/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.14.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:40:01,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:40:01,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:40:01,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:40:01,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:40:01,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:40:01,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:40:01,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:40:01,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:40:01,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:40:01,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:40:01,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:40:01,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:40:01,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:40:01,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:40:01,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:40:01,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:40:01,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:40:01,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:40:01,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:40:01,886 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:40:01,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:40:01,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:40:01,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:40:01,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:40:01,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:40:01,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:40:01,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:40:01,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:40:01,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:40:01,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:40:01,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:40:01,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:40:01,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:40:01,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:40:01,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:40:01,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:40:01,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:40:01,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:40:01,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:40:01,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:40:01,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:40:01,911 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:40:01,946 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:40:01,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:40:01,947 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:40:01,947 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:40:01,947 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:40:01,948 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:40:01,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:40:01,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:40:01,948 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:40:01,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:40:01,949 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:40:01,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:40:01,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:40:01,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:40:01,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:40:01,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:40:01,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:40:01,949 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:40:01,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:40:01,950 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:40:01,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:40:01,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:40:01,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:40:01,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:40:01,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:40:01,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:40:01,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:40:01,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:40:01,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:40:01,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:40:01,953 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:40:01,953 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:40:01,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:40:01,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:40:02,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:40:02,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:40:02,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:40:02,184 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:40:02,185 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:40:02,186 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.14.i.cil-2.c [2022-04-27 15:40:02,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e14134064/12229558d374454e81f278410b6d7ad0/FLAG4cbf9fa9b [2022-04-27 15:40:02,654 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:40:02,654 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.14.i.cil-2.c [2022-04-27 15:40:02,683 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e14134064/12229558d374454e81f278410b6d7ad0/FLAG4cbf9fa9b [2022-04-27 15:40:02,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e14134064/12229558d374454e81f278410b6d7ad0 [2022-04-27 15:40:02,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:40:02,994 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:40:02,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:40:02,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:40:03,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:40:03,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:40:02" (1/1) ... [2022-04-27 15:40:03,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:40:03, skipping insertion in model container [2022-04-27 15:40:03,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:40:02" (1/1) ... [2022-04-27 15:40:03,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:40:03,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:40:03,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.14.i.cil-2.c[76259,76272] [2022-04-27 15:40:03,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:40:03,415 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:40:03,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.14.i.cil-2.c[76259,76272] [2022-04-27 15:40:03,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:40:03,547 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:40:03,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:40:03 WrapperNode [2022-04-27 15:40:03,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:40:03,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:40:03,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:40:03,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:40:03,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:40:03" (1/1) ... [2022-04-27 15:40:03,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:40:03" (1/1) ... [2022-04-27 15:40:03,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:40:03" (1/1) ... [2022-04-27 15:40:03,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:40:03" (1/1) ... [2022-04-27 15:40:03,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:40:03" (1/1) ... [2022-04-27 15:40:03,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:40:03" (1/1) ... [2022-04-27 15:40:03,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:40:03" (1/1) ... [2022-04-27 15:40:03,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:40:03,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:40:03,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:40:03,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:40:03,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:40:03" (1/1) ... [2022-04-27 15:40:03,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:40:03,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:40:03,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 15:40:03,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 15:40:03,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:40:03,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:40:03,769 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:40:03,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-27 15:40:03,770 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-27 15:40:03,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:40:03,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-27 15:40:03,770 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-27 15:40:03,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 15:40:03,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-27 15:40:03,771 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:40:03,771 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:40:03,771 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:40:03,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:40:03,771 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-27 15:40:03,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 15:40:03,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:40:03,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-27 15:40:03,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-27 15:40:03,772 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-27 15:40:03,772 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-27 15:40:03,772 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-27 15:40:03,772 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-27 15:40:03,772 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-27 15:40:03,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-27 15:40:03,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-27 15:40:03,772 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:40:03,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 15:40:03,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:40:03,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-27 15:40:03,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:40:03,773 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 15:40:03,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 15:40:03,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:40:03,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:40:03,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:40:03,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-27 15:40:03,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-27 15:40:03,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-27 15:40:03,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-27 15:40:03,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:40:03,958 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:40:03,970 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:40:04,705 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-27 15:40:05,301 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-27 15:40:05,302 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-27 15:40:05,317 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:40:05,336 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:40:05,337 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:40:05,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:40:05 BoogieIcfgContainer [2022-04-27 15:40:05,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:40:05,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:40:05,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:40:05,344 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:40:05,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:40:02" (1/3) ... [2022-04-27 15:40:05,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be976ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:40:05, skipping insertion in model container [2022-04-27 15:40:05,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:40:03" (2/3) ... [2022-04-27 15:40:05,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be976ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:40:05, skipping insertion in model container [2022-04-27 15:40:05,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:40:05" (3/3) ... [2022-04-27 15:40:05,352 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-2.c [2022-04-27 15:40:05,385 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:40:05,386 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:40:05,429 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:40:05,435 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@24c919c9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48a47f5a [2022-04-27 15:40:05,435 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:40:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 155 states have (on average 1.7161290322580645) internal successors, (266), 156 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:40:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 15:40:05,453 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:40:05,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:40:05,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:40:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:40:05,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1492919843, now seen corresponding path program 1 times [2022-04-27 15:40:05,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:40:05,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855804773] [2022-04-27 15:40:05,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:40:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:40:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:06,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:40:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:06,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {166#true} is VALID [2022-04-27 15:40:06,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#true} assume true; {166#true} is VALID [2022-04-27 15:40:06,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {166#true} {166#true} #720#return; {166#true} is VALID [2022-04-27 15:40:06,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} call ULTIMATE.init(); {173#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:40:06,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {166#true} is VALID [2022-04-27 15:40:06,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {166#true} assume true; {166#true} is VALID [2022-04-27 15:40:06,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166#true} {166#true} #720#return; {166#true} is VALID [2022-04-27 15:40:06,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {166#true} call #t~ret161 := main(); {166#true} is VALID [2022-04-27 15:40:06,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {166#true} is VALID [2022-04-27 15:40:06,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {166#true} is VALID [2022-04-27 15:40:06,033 INFO L272 TraceCheckUtils]: 7: Hoare triple {166#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {166#true} is VALID [2022-04-27 15:40:06,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,065 INFO L290 TraceCheckUtils]: 39: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:06,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {172#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-27 15:40:06,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {172#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {167#false} is VALID [2022-04-27 15:40:06,069 INFO L290 TraceCheckUtils]: 45: Hoare triple {167#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {167#false} is VALID [2022-04-27 15:40:06,072 INFO L290 TraceCheckUtils]: 46: Hoare triple {167#false} assume !(9 == ~blastFlag~0); {167#false} is VALID [2022-04-27 15:40:06,073 INFO L290 TraceCheckUtils]: 47: Hoare triple {167#false} assume !(12 == ~blastFlag~0); {167#false} is VALID [2022-04-27 15:40:06,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-04-27 15:40:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:40:06,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:40:06,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855804773] [2022-04-27 15:40:06,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855804773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:40:06,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:40:06,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:40:06,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73542187] [2022-04-27 15:40:06,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:40:06,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-27 15:40:06,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:40:06,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:06,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:06,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:40:06,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:40:06,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:40:06,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:40:06,204 INFO L87 Difference]: Start difference. First operand has 163 states, 155 states have (on average 1.7161290322580645) internal successors, (266), 156 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:10,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:10,341 INFO L93 Difference]: Finished difference Result 445 states and 756 transitions. [2022-04-27 15:40:10,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:40:10,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-27 15:40:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:40:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 756 transitions. [2022-04-27 15:40:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 756 transitions. [2022-04-27 15:40:10,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 756 transitions. [2022-04-27 15:40:11,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 756 edges. 756 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:11,026 INFO L225 Difference]: With dead ends: 445 [2022-04-27 15:40:11,027 INFO L226 Difference]: Without dead ends: 271 [2022-04-27 15:40:11,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:40:11,033 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 164 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:40:11,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 491 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-27 15:40:11,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-27 15:40:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 187. [2022-04-27 15:40:11,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:40:11,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 187 states, 182 states have (on average 1.6153846153846154) internal successors, (294), 182 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:11,071 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 187 states, 182 states have (on average 1.6153846153846154) internal successors, (294), 182 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:11,072 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 187 states, 182 states have (on average 1.6153846153846154) internal successors, (294), 182 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:11,085 INFO L93 Difference]: Finished difference Result 271 states and 419 transitions. [2022-04-27 15:40:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 419 transitions. [2022-04-27 15:40:11,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:11,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:11,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.6153846153846154) internal successors, (294), 182 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 271 states. [2022-04-27 15:40:11,088 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.6153846153846154) internal successors, (294), 182 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 271 states. [2022-04-27 15:40:11,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:11,100 INFO L93 Difference]: Finished difference Result 271 states and 419 transitions. [2022-04-27 15:40:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 419 transitions. [2022-04-27 15:40:11,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:11,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:11,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:40:11,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:40:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.6153846153846154) internal successors, (294), 182 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 298 transitions. [2022-04-27 15:40:11,111 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 298 transitions. Word has length 49 [2022-04-27 15:40:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:40:11,111 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 298 transitions. [2022-04-27 15:40:11,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 298 transitions. [2022-04-27 15:40:11,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 15:40:11,113 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:40:11,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:40:11,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:40:11,113 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:40:11,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:40:11,114 INFO L85 PathProgramCache]: Analyzing trace with hash 723852413, now seen corresponding path program 1 times [2022-04-27 15:40:11,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:40:11,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558700032] [2022-04-27 15:40:11,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:40:11,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:40:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:11,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:40:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:11,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {1474#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1467#true} is VALID [2022-04-27 15:40:11,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {1467#true} assume true; {1467#true} is VALID [2022-04-27 15:40:11,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1467#true} {1467#true} #720#return; {1467#true} is VALID [2022-04-27 15:40:11,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {1467#true} call ULTIMATE.init(); {1474#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:40:11,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {1474#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1467#true} is VALID [2022-04-27 15:40:11,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {1467#true} assume true; {1467#true} is VALID [2022-04-27 15:40:11,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1467#true} {1467#true} #720#return; {1467#true} is VALID [2022-04-27 15:40:11,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {1467#true} call #t~ret161 := main(); {1467#true} is VALID [2022-04-27 15:40:11,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {1467#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1467#true} is VALID [2022-04-27 15:40:11,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {1467#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1467#true} is VALID [2022-04-27 15:40:11,357 INFO L272 TraceCheckUtils]: 7: Hoare triple {1467#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1467#true} is VALID [2022-04-27 15:40:11,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {1467#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:11,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {1472#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1473#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-27 15:40:11,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {1473#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {1468#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {1468#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {1468#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {1468#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {1468#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {1468#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {1468#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {1468#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {1468#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {1468#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {1468#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {1468#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {1468#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {1468#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {1468#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {1468#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {1468#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {1468#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {1468#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {1468#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {1468#false} is VALID [2022-04-27 15:40:11,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {1468#false} assume 8641 == #t~mem76;havoc #t~mem76; {1468#false} is VALID [2022-04-27 15:40:11,372 INFO L290 TraceCheckUtils]: 46: Hoare triple {1468#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1468#false} is VALID [2022-04-27 15:40:11,372 INFO L290 TraceCheckUtils]: 47: Hoare triple {1468#false} assume !(9 == ~blastFlag~0); {1468#false} is VALID [2022-04-27 15:40:11,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {1468#false} assume !(12 == ~blastFlag~0); {1468#false} is VALID [2022-04-27 15:40:11,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {1468#false} assume !false; {1468#false} is VALID [2022-04-27 15:40:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:40:11,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:40:11,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558700032] [2022-04-27 15:40:11,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558700032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:40:11,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:40:11,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:40:11,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597457100] [2022-04-27 15:40:11,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:40:11,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-27 15:40:11,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:40:11,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:11,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:11,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:40:11,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:40:11,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:40:11,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:40:11,434 INFO L87 Difference]: Start difference. First operand 187 states and 298 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:14,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:40:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:16,301 INFO L93 Difference]: Finished difference Result 387 states and 618 transitions. [2022-04-27 15:40:16,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:40:16,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-27 15:40:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:40:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-27 15:40:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-27 15:40:16,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-27 15:40:16,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:16,691 INFO L225 Difference]: With dead ends: 387 [2022-04-27 15:40:16,691 INFO L226 Difference]: Without dead ends: 215 [2022-04-27 15:40:16,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:40:16,693 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 22 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:40:16,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 511 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-27 15:40:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-27 15:40:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 198. [2022-04-27 15:40:16,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:40:16,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 198 states, 193 states have (on average 1.621761658031088) internal successors, (313), 193 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:16,704 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 198 states, 193 states have (on average 1.621761658031088) internal successors, (313), 193 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:16,705 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 198 states, 193 states have (on average 1.621761658031088) internal successors, (313), 193 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:16,712 INFO L93 Difference]: Finished difference Result 215 states and 338 transitions. [2022-04-27 15:40:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 338 transitions. [2022-04-27 15:40:16,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:16,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:16,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 193 states have (on average 1.621761658031088) internal successors, (313), 193 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-27 15:40:16,714 INFO L87 Difference]: Start difference. First operand has 198 states, 193 states have (on average 1.621761658031088) internal successors, (313), 193 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-27 15:40:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:16,720 INFO L93 Difference]: Finished difference Result 215 states and 338 transitions. [2022-04-27 15:40:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 338 transitions. [2022-04-27 15:40:16,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:16,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:16,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:40:16,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:40:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.621761658031088) internal successors, (313), 193 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 317 transitions. [2022-04-27 15:40:16,728 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 317 transitions. Word has length 50 [2022-04-27 15:40:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:40:16,728 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 317 transitions. [2022-04-27 15:40:16,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 317 transitions. [2022-04-27 15:40:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 15:40:16,729 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:40:16,730 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:40:16,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:40:16,730 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:40:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:40:16,730 INFO L85 PathProgramCache]: Analyzing trace with hash -196136314, now seen corresponding path program 1 times [2022-04-27 15:40:16,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:40:16,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534283409] [2022-04-27 15:40:16,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:40:16,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:40:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:16,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:40:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:16,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {2595#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2588#true} is VALID [2022-04-27 15:40:16,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {2588#true} assume true; {2588#true} is VALID [2022-04-27 15:40:16,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2588#true} {2588#true} #720#return; {2588#true} is VALID [2022-04-27 15:40:16,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {2588#true} call ULTIMATE.init(); {2595#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:40:16,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {2595#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2588#true} is VALID [2022-04-27 15:40:16,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {2588#true} assume true; {2588#true} is VALID [2022-04-27 15:40:16,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2588#true} {2588#true} #720#return; {2588#true} is VALID [2022-04-27 15:40:16,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {2588#true} call #t~ret161 := main(); {2588#true} is VALID [2022-04-27 15:40:16,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {2588#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {2588#true} is VALID [2022-04-27 15:40:16,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {2588#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2588#true} is VALID [2022-04-27 15:40:16,894 INFO L272 TraceCheckUtils]: 7: Hoare triple {2588#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2588#true} is VALID [2022-04-27 15:40:16,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {2588#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:16,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:16,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:16,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:16,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:16,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:16,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:16,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:16,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:16,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:16,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:16,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:16,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {2593#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2594#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-27 15:40:16,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {2594#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {2589#false} is VALID [2022-04-27 15:40:16,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {2589#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {2589#false} is VALID [2022-04-27 15:40:16,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {2589#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {2589#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {2589#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {2589#false} is VALID [2022-04-27 15:40:16,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {2589#false} ~skip~0 := 0; {2589#false} is VALID [2022-04-27 15:40:16,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {2589#false} assume !false; {2589#false} is VALID [2022-04-27 15:40:16,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {2589#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {2589#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {2589#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {2589#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {2589#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {2589#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {2589#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {2589#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {2589#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {2589#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {2589#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {2589#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {2589#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,924 INFO L290 TraceCheckUtils]: 41: Hoare triple {2589#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {2589#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {2589#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,925 INFO L290 TraceCheckUtils]: 44: Hoare triple {2589#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,925 INFO L290 TraceCheckUtils]: 45: Hoare triple {2589#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,925 INFO L290 TraceCheckUtils]: 46: Hoare triple {2589#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,925 INFO L290 TraceCheckUtils]: 47: Hoare triple {2589#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,925 INFO L290 TraceCheckUtils]: 48: Hoare triple {2589#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,925 INFO L290 TraceCheckUtils]: 49: Hoare triple {2589#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,925 INFO L290 TraceCheckUtils]: 50: Hoare triple {2589#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,926 INFO L290 TraceCheckUtils]: 51: Hoare triple {2589#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,926 INFO L290 TraceCheckUtils]: 52: Hoare triple {2589#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,926 INFO L290 TraceCheckUtils]: 53: Hoare triple {2589#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,926 INFO L290 TraceCheckUtils]: 54: Hoare triple {2589#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,926 INFO L290 TraceCheckUtils]: 55: Hoare triple {2589#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,926 INFO L290 TraceCheckUtils]: 56: Hoare triple {2589#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,926 INFO L290 TraceCheckUtils]: 57: Hoare triple {2589#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {2589#false} is VALID [2022-04-27 15:40:16,926 INFO L290 TraceCheckUtils]: 58: Hoare triple {2589#false} assume 8641 == #t~mem76;havoc #t~mem76; {2589#false} is VALID [2022-04-27 15:40:16,927 INFO L290 TraceCheckUtils]: 59: Hoare triple {2589#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {2589#false} is VALID [2022-04-27 15:40:16,927 INFO L290 TraceCheckUtils]: 60: Hoare triple {2589#false} assume !(9 == ~blastFlag~0); {2589#false} is VALID [2022-04-27 15:40:16,927 INFO L290 TraceCheckUtils]: 61: Hoare triple {2589#false} assume !(12 == ~blastFlag~0); {2589#false} is VALID [2022-04-27 15:40:16,927 INFO L290 TraceCheckUtils]: 62: Hoare triple {2589#false} assume !false; {2589#false} is VALID [2022-04-27 15:40:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:40:16,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:40:16,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534283409] [2022-04-27 15:40:16,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534283409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:40:16,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:40:16,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:40:16,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361230323] [2022-04-27 15:40:16,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:40:16,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-27 15:40:16,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:40:16,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:16,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:16,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:40:16,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:40:16,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:40:16,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:40:16,976 INFO L87 Difference]: Start difference. First operand 198 states and 317 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:21,001 INFO L93 Difference]: Finished difference Result 387 states and 617 transitions. [2022-04-27 15:40:21,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:40:21,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-27 15:40:21,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:40:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-27 15:40:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-27 15:40:21,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-27 15:40:21,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:21,345 INFO L225 Difference]: With dead ends: 387 [2022-04-27 15:40:21,345 INFO L226 Difference]: Without dead ends: 215 [2022-04-27 15:40:21,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:40:21,347 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 24 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:40:21,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 513 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-27 15:40:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-27 15:40:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 198. [2022-04-27 15:40:21,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:40:21,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 198 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:21,356 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 198 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:21,357 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 198 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:21,363 INFO L93 Difference]: Finished difference Result 215 states and 337 transitions. [2022-04-27 15:40:21,363 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 337 transitions. [2022-04-27 15:40:21,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:21,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:21,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-27 15:40:21,365 INFO L87 Difference]: Start difference. First operand has 198 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-27 15:40:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:21,371 INFO L93 Difference]: Finished difference Result 215 states and 337 transitions. [2022-04-27 15:40:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 337 transitions. [2022-04-27 15:40:21,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:21,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:21,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:40:21,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:40:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 316 transitions. [2022-04-27 15:40:21,378 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 316 transitions. Word has length 63 [2022-04-27 15:40:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:40:21,378 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 316 transitions. [2022-04-27 15:40:21,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 316 transitions. [2022-04-27 15:40:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 15:40:21,379 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:40:21,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:40:21,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:40:21,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:40:21,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:40:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2113932086, now seen corresponding path program 1 times [2022-04-27 15:40:21,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:40:21,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289942479] [2022-04-27 15:40:21,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:40:21,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:40:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:21,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:40:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:21,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {3716#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3709#true} is VALID [2022-04-27 15:40:21,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {3709#true} assume true; {3709#true} is VALID [2022-04-27 15:40:21,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3709#true} {3709#true} #720#return; {3709#true} is VALID [2022-04-27 15:40:21,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {3709#true} call ULTIMATE.init(); {3716#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:40:21,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {3716#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3709#true} is VALID [2022-04-27 15:40:21,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {3709#true} assume true; {3709#true} is VALID [2022-04-27 15:40:21,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3709#true} {3709#true} #720#return; {3709#true} is VALID [2022-04-27 15:40:21,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {3709#true} call #t~ret161 := main(); {3709#true} is VALID [2022-04-27 15:40:21,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {3709#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3709#true} is VALID [2022-04-27 15:40:21,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {3709#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3709#true} is VALID [2022-04-27 15:40:21,572 INFO L272 TraceCheckUtils]: 7: Hoare triple {3709#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3709#true} is VALID [2022-04-27 15:40:21,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {3709#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3714#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:21,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {3714#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3714#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:21,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {3714#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {3714#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:21,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {3714#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3714#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:21,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {3714#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {3714#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:21,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {3714#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {3714#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:21,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {3714#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3714#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:21,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {3714#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3715#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-27 15:40:21,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {3715#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {3710#false} is VALID [2022-04-27 15:40:21,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {3710#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {3710#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {3710#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3710#false} is VALID [2022-04-27 15:40:21,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {3710#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {3710#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {3710#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {3710#false} is VALID [2022-04-27 15:40:21,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {3710#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {3710#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {3710#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {3710#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3710#false} is VALID [2022-04-27 15:40:21,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {3710#false} ~skip~0 := 0; {3710#false} is VALID [2022-04-27 15:40:21,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {3710#false} assume !false; {3710#false} is VALID [2022-04-27 15:40:21,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {3710#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {3710#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {3710#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {3710#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {3710#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {3710#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {3710#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,581 INFO L290 TraceCheckUtils]: 36: Hoare triple {3710#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,581 INFO L290 TraceCheckUtils]: 37: Hoare triple {3710#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {3710#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {3710#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {3710#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {3710#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {3710#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {3710#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,582 INFO L290 TraceCheckUtils]: 44: Hoare triple {3710#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,582 INFO L290 TraceCheckUtils]: 45: Hoare triple {3710#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,582 INFO L290 TraceCheckUtils]: 46: Hoare triple {3710#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,583 INFO L290 TraceCheckUtils]: 47: Hoare triple {3710#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,583 INFO L290 TraceCheckUtils]: 48: Hoare triple {3710#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {3710#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {3710#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {3710#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,583 INFO L290 TraceCheckUtils]: 52: Hoare triple {3710#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,583 INFO L290 TraceCheckUtils]: 53: Hoare triple {3710#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,583 INFO L290 TraceCheckUtils]: 54: Hoare triple {3710#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,584 INFO L290 TraceCheckUtils]: 55: Hoare triple {3710#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {3710#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {3710#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,584 INFO L290 TraceCheckUtils]: 58: Hoare triple {3710#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {3710#false} is VALID [2022-04-27 15:40:21,584 INFO L290 TraceCheckUtils]: 59: Hoare triple {3710#false} assume 8641 == #t~mem76;havoc #t~mem76; {3710#false} is VALID [2022-04-27 15:40:21,584 INFO L290 TraceCheckUtils]: 60: Hoare triple {3710#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3710#false} is VALID [2022-04-27 15:40:21,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {3710#false} assume !(9 == ~blastFlag~0); {3710#false} is VALID [2022-04-27 15:40:21,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {3710#false} assume !(12 == ~blastFlag~0); {3710#false} is VALID [2022-04-27 15:40:21,585 INFO L290 TraceCheckUtils]: 63: Hoare triple {3710#false} assume !false; {3710#false} is VALID [2022-04-27 15:40:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:40:21,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:40:21,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289942479] [2022-04-27 15:40:21,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289942479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:40:21,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:40:21,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:40:21,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799988929] [2022-04-27 15:40:21,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:40:21,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-27 15:40:21,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:40:21,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:21,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:21,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:40:21,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:40:21,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:40:21,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:40:21,640 INFO L87 Difference]: Start difference. First operand 198 states and 316 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:26,899 INFO L93 Difference]: Finished difference Result 386 states and 615 transitions. [2022-04-27 15:40:26,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:40:26,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-27 15:40:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:40:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2022-04-27 15:40:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2022-04-27 15:40:26,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 469 transitions. [2022-04-27 15:40:27,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 469 edges. 469 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:27,230 INFO L225 Difference]: With dead ends: 386 [2022-04-27 15:40:27,230 INFO L226 Difference]: Without dead ends: 214 [2022-04-27 15:40:27,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:40:27,231 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 28 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:40:27,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 515 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:40:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-04-27 15:40:27,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 198. [2022-04-27 15:40:27,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:40:27,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 198 states, 193 states have (on average 1.61139896373057) internal successors, (311), 193 states have internal predecessors, (311), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:27,241 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 198 states, 193 states have (on average 1.61139896373057) internal successors, (311), 193 states have internal predecessors, (311), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:27,242 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 198 states, 193 states have (on average 1.61139896373057) internal successors, (311), 193 states have internal predecessors, (311), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:27,246 INFO L93 Difference]: Finished difference Result 214 states and 335 transitions. [2022-04-27 15:40:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 335 transitions. [2022-04-27 15:40:27,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:27,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:27,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 193 states have (on average 1.61139896373057) internal successors, (311), 193 states have internal predecessors, (311), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 214 states. [2022-04-27 15:40:27,248 INFO L87 Difference]: Start difference. First operand has 198 states, 193 states have (on average 1.61139896373057) internal successors, (311), 193 states have internal predecessors, (311), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 214 states. [2022-04-27 15:40:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:27,259 INFO L93 Difference]: Finished difference Result 214 states and 335 transitions. [2022-04-27 15:40:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 335 transitions. [2022-04-27 15:40:27,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:27,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:27,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:40:27,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:40:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.61139896373057) internal successors, (311), 193 states have internal predecessors, (311), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 315 transitions. [2022-04-27 15:40:27,265 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 315 transitions. Word has length 64 [2022-04-27 15:40:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:40:27,265 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 315 transitions. [2022-04-27 15:40:27,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 315 transitions. [2022-04-27 15:40:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 15:40:27,266 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:40:27,267 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:40:27,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:40:27,267 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:40:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:40:27,267 INFO L85 PathProgramCache]: Analyzing trace with hash -294131766, now seen corresponding path program 1 times [2022-04-27 15:40:27,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:40:27,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295366395] [2022-04-27 15:40:27,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:40:27,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:40:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:27,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:40:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:27,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {4833#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4826#true} is VALID [2022-04-27 15:40:27,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {4826#true} assume true; {4826#true} is VALID [2022-04-27 15:40:27,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4826#true} {4826#true} #720#return; {4826#true} is VALID [2022-04-27 15:40:27,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {4826#true} call ULTIMATE.init(); {4833#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:40:27,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {4833#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4826#true} is VALID [2022-04-27 15:40:27,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {4826#true} assume true; {4826#true} is VALID [2022-04-27 15:40:27,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4826#true} {4826#true} #720#return; {4826#true} is VALID [2022-04-27 15:40:27,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {4826#true} call #t~ret161 := main(); {4826#true} is VALID [2022-04-27 15:40:27,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {4826#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {4826#true} is VALID [2022-04-27 15:40:27,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {4826#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4826#true} is VALID [2022-04-27 15:40:27,414 INFO L272 TraceCheckUtils]: 7: Hoare triple {4826#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4826#true} is VALID [2022-04-27 15:40:27,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {4826#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:27,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:27,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:27,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:27,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:27,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:27,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:27,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:27,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {4831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4832#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-27 15:40:27,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {4832#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {4827#false} is VALID [2022-04-27 15:40:27,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {4827#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {4827#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4827#false} is VALID [2022-04-27 15:40:27,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {4827#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {4827#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {4827#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {4827#false} is VALID [2022-04-27 15:40:27,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {4827#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {4827#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {4827#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {4827#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {4827#false} is VALID [2022-04-27 15:40:27,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {4827#false} ~skip~0 := 0; {4827#false} is VALID [2022-04-27 15:40:27,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {4827#false} assume !false; {4827#false} is VALID [2022-04-27 15:40:27,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {4827#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {4827#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {4827#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {4827#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {4827#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {4827#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {4827#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {4827#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {4827#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {4827#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {4827#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {4827#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {4827#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {4827#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {4827#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {4827#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,428 INFO L290 TraceCheckUtils]: 45: Hoare triple {4827#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {4827#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {4827#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,428 INFO L290 TraceCheckUtils]: 48: Hoare triple {4827#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {4827#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,429 INFO L290 TraceCheckUtils]: 50: Hoare triple {4827#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,429 INFO L290 TraceCheckUtils]: 51: Hoare triple {4827#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,429 INFO L290 TraceCheckUtils]: 52: Hoare triple {4827#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,429 INFO L290 TraceCheckUtils]: 53: Hoare triple {4827#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,429 INFO L290 TraceCheckUtils]: 54: Hoare triple {4827#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,429 INFO L290 TraceCheckUtils]: 55: Hoare triple {4827#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,429 INFO L290 TraceCheckUtils]: 56: Hoare triple {4827#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,429 INFO L290 TraceCheckUtils]: 57: Hoare triple {4827#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,429 INFO L290 TraceCheckUtils]: 58: Hoare triple {4827#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {4827#false} is VALID [2022-04-27 15:40:27,430 INFO L290 TraceCheckUtils]: 59: Hoare triple {4827#false} assume 8641 == #t~mem76;havoc #t~mem76; {4827#false} is VALID [2022-04-27 15:40:27,430 INFO L290 TraceCheckUtils]: 60: Hoare triple {4827#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {4827#false} is VALID [2022-04-27 15:40:27,430 INFO L290 TraceCheckUtils]: 61: Hoare triple {4827#false} assume !(9 == ~blastFlag~0); {4827#false} is VALID [2022-04-27 15:40:27,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {4827#false} assume !(12 == ~blastFlag~0); {4827#false} is VALID [2022-04-27 15:40:27,431 INFO L290 TraceCheckUtils]: 63: Hoare triple {4827#false} assume !false; {4827#false} is VALID [2022-04-27 15:40:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:40:27,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:40:27,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295366395] [2022-04-27 15:40:27,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295366395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:40:27,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:40:27,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:40:27,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233847418] [2022-04-27 15:40:27,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:40:27,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-27 15:40:27,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:40:27,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:27,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:27,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:40:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:40:27,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:40:27,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:40:27,488 INFO L87 Difference]: Start difference. First operand 198 states and 315 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:30,744 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:40:34,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:34,335 INFO L93 Difference]: Finished difference Result 493 states and 788 transitions. [2022-04-27 15:40:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:40:34,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-27 15:40:34,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:40:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 625 transitions. [2022-04-27 15:40:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 625 transitions. [2022-04-27 15:40:34,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 625 transitions. [2022-04-27 15:40:34,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 625 edges. 625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:34,873 INFO L225 Difference]: With dead ends: 493 [2022-04-27 15:40:34,873 INFO L226 Difference]: Without dead ends: 321 [2022-04-27 15:40:34,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:40:34,877 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 159 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:40:34,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 374 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-27 15:40:34,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-27 15:40:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 210. [2022-04-27 15:40:34,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:40:34,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 210 states, 205 states have (on average 1.5951219512195123) internal successors, (327), 205 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:34,893 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 210 states, 205 states have (on average 1.5951219512195123) internal successors, (327), 205 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:34,894 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 210 states, 205 states have (on average 1.5951219512195123) internal successors, (327), 205 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:34,899 INFO L93 Difference]: Finished difference Result 321 states and 506 transitions. [2022-04-27 15:40:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 506 transitions. [2022-04-27 15:40:34,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:34,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:34,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 210 states, 205 states have (on average 1.5951219512195123) internal successors, (327), 205 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-27 15:40:34,901 INFO L87 Difference]: Start difference. First operand has 210 states, 205 states have (on average 1.5951219512195123) internal successors, (327), 205 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-27 15:40:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:34,909 INFO L93 Difference]: Finished difference Result 321 states and 506 transitions. [2022-04-27 15:40:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 506 transitions. [2022-04-27 15:40:34,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:34,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:34,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:40:34,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:40:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.5951219512195123) internal successors, (327), 205 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 331 transitions. [2022-04-27 15:40:34,915 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 331 transitions. Word has length 64 [2022-04-27 15:40:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:40:34,915 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 331 transitions. [2022-04-27 15:40:34,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 331 transitions. [2022-04-27 15:40:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 15:40:34,916 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:40:34,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:40:34,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:40:34,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:40:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:40:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 820875073, now seen corresponding path program 1 times [2022-04-27 15:40:34,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:40:34,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426235004] [2022-04-27 15:40:34,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:40:34,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:40:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:35,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:40:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:35,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {6304#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6297#true} is VALID [2022-04-27 15:40:35,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {6297#true} assume true; {6297#true} is VALID [2022-04-27 15:40:35,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6297#true} {6297#true} #720#return; {6297#true} is VALID [2022-04-27 15:40:35,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {6297#true} call ULTIMATE.init(); {6304#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:40:35,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {6304#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6297#true} is VALID [2022-04-27 15:40:35,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {6297#true} assume true; {6297#true} is VALID [2022-04-27 15:40:35,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6297#true} {6297#true} #720#return; {6297#true} is VALID [2022-04-27 15:40:35,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {6297#true} call #t~ret161 := main(); {6297#true} is VALID [2022-04-27 15:40:35,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {6297#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {6297#true} is VALID [2022-04-27 15:40:35,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {6297#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6297#true} is VALID [2022-04-27 15:40:35,095 INFO L272 TraceCheckUtils]: 7: Hoare triple {6297#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6297#true} is VALID [2022-04-27 15:40:35,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {6297#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:40:35,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:40:35,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:40:35,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:40:35,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:40:35,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:40:35,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:40:35,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:40:35,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:40:35,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:40:35,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:40:35,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:40:35,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:40:35,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {6302#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6303#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-27 15:40:35,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {6303#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {6298#false} is VALID [2022-04-27 15:40:35,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {6298#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {6298#false} is VALID [2022-04-27 15:40:35,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {6298#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {6298#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {6298#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {6298#false} is VALID [2022-04-27 15:40:35,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {6298#false} ~skip~0 := 0; {6298#false} is VALID [2022-04-27 15:40:35,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {6298#false} assume !false; {6298#false} is VALID [2022-04-27 15:40:35,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {6298#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {6298#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {6298#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {6298#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {6298#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {6298#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {6298#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,106 INFO L290 TraceCheckUtils]: 36: Hoare triple {6298#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {6298#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {6298#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {6298#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {6298#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {6298#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {6298#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,107 INFO L290 TraceCheckUtils]: 43: Hoare triple {6298#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {6298#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {6298#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {6298#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,107 INFO L290 TraceCheckUtils]: 47: Hoare triple {6298#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,107 INFO L290 TraceCheckUtils]: 48: Hoare triple {6298#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,107 INFO L290 TraceCheckUtils]: 49: Hoare triple {6298#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,108 INFO L290 TraceCheckUtils]: 50: Hoare triple {6298#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,108 INFO L290 TraceCheckUtils]: 51: Hoare triple {6298#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,108 INFO L290 TraceCheckUtils]: 52: Hoare triple {6298#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,108 INFO L290 TraceCheckUtils]: 53: Hoare triple {6298#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,108 INFO L290 TraceCheckUtils]: 54: Hoare triple {6298#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,108 INFO L290 TraceCheckUtils]: 55: Hoare triple {6298#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {6298#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {6298#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,109 INFO L290 TraceCheckUtils]: 58: Hoare triple {6298#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {6298#false} is VALID [2022-04-27 15:40:35,109 INFO L290 TraceCheckUtils]: 59: Hoare triple {6298#false} assume 8641 == #t~mem76;havoc #t~mem76; {6298#false} is VALID [2022-04-27 15:40:35,110 INFO L290 TraceCheckUtils]: 60: Hoare triple {6298#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {6298#false} is VALID [2022-04-27 15:40:35,110 INFO L290 TraceCheckUtils]: 61: Hoare triple {6298#false} assume !(9 == ~blastFlag~0); {6298#false} is VALID [2022-04-27 15:40:35,112 INFO L290 TraceCheckUtils]: 62: Hoare triple {6298#false} assume !(12 == ~blastFlag~0); {6298#false} is VALID [2022-04-27 15:40:35,113 INFO L290 TraceCheckUtils]: 63: Hoare triple {6298#false} assume !false; {6298#false} is VALID [2022-04-27 15:40:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:40:35,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:40:35,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426235004] [2022-04-27 15:40:35,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426235004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:40:35,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:40:35,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:40:35,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790611271] [2022-04-27 15:40:35,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:40:35,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-27 15:40:35,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:40:35,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:35,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:35,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:40:35,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:40:35,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:40:35,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:40:35,164 INFO L87 Difference]: Start difference. First operand 210 states and 331 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:41,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:41,779 INFO L93 Difference]: Finished difference Result 505 states and 802 transitions. [2022-04-27 15:40:41,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:40:41,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-27 15:40:41,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:40:41,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2022-04-27 15:40:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:41,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2022-04-27 15:40:41,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 624 transitions. [2022-04-27 15:40:42,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 624 edges. 624 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:42,317 INFO L225 Difference]: With dead ends: 505 [2022-04-27 15:40:42,317 INFO L226 Difference]: Without dead ends: 321 [2022-04-27 15:40:42,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:40:42,318 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 153 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:40:42,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 374 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 15:40:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-27 15:40:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 215. [2022-04-27 15:40:42,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:40:42,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 215 states, 210 states have (on average 1.5904761904761904) internal successors, (334), 210 states have internal predecessors, (334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:42,333 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 215 states, 210 states have (on average 1.5904761904761904) internal successors, (334), 210 states have internal predecessors, (334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:42,333 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 215 states, 210 states have (on average 1.5904761904761904) internal successors, (334), 210 states have internal predecessors, (334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:42,340 INFO L93 Difference]: Finished difference Result 321 states and 503 transitions. [2022-04-27 15:40:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 503 transitions. [2022-04-27 15:40:42,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:42,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:42,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 210 states have (on average 1.5904761904761904) internal successors, (334), 210 states have internal predecessors, (334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-27 15:40:42,343 INFO L87 Difference]: Start difference. First operand has 215 states, 210 states have (on average 1.5904761904761904) internal successors, (334), 210 states have internal predecessors, (334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-27 15:40:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:42,351 INFO L93 Difference]: Finished difference Result 321 states and 503 transitions. [2022-04-27 15:40:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 503 transitions. [2022-04-27 15:40:42,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:42,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:42,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:40:42,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:40:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 210 states have (on average 1.5904761904761904) internal successors, (334), 210 states have internal predecessors, (334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 338 transitions. [2022-04-27 15:40:42,358 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 338 transitions. Word has length 64 [2022-04-27 15:40:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:40:42,358 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 338 transitions. [2022-04-27 15:40:42,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 338 transitions. [2022-04-27 15:40:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 15:40:42,361 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:40:42,362 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-27 15:40:42,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:40:42,362 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:40:42,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:40:42,362 INFO L85 PathProgramCache]: Analyzing trace with hash 888435074, now seen corresponding path program 1 times [2022-04-27 15:40:42,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:40:42,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912131350] [2022-04-27 15:40:42,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:40:42,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:40:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:42,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:40:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:42,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {7794#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7787#true} is VALID [2022-04-27 15:40:42,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {7787#true} assume true; {7787#true} is VALID [2022-04-27 15:40:42,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7787#true} {7787#true} #720#return; {7787#true} is VALID [2022-04-27 15:40:42,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {7787#true} call ULTIMATE.init(); {7794#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:40:42,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {7794#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7787#true} is VALID [2022-04-27 15:40:42,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {7787#true} assume true; {7787#true} is VALID [2022-04-27 15:40:42,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7787#true} {7787#true} #720#return; {7787#true} is VALID [2022-04-27 15:40:42,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {7787#true} call #t~ret161 := main(); {7787#true} is VALID [2022-04-27 15:40:42,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {7787#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7787#true} is VALID [2022-04-27 15:40:42,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {7787#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {7787#true} is VALID [2022-04-27 15:40:42,519 INFO L272 TraceCheckUtils]: 7: Hoare triple {7787#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7787#true} is VALID [2022-04-27 15:40:42,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {7787#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:42,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:42,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:42,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:42,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:42,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:42,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:42,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:42,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:42,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:42,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:42,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:42,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:42,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:42,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {7792#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7793#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-27 15:40:42,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {7793#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {7788#false} is VALID [2022-04-27 15:40:42,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {7788#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {7788#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {7788#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7788#false} is VALID [2022-04-27 15:40:42,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {7788#false} ~skip~0 := 0; {7788#false} is VALID [2022-04-27 15:40:42,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {7788#false} assume !false; {7788#false} is VALID [2022-04-27 15:40:42,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {7788#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {7788#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {7788#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {7788#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {7788#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {7788#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,529 INFO L290 TraceCheckUtils]: 35: Hoare triple {7788#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,529 INFO L290 TraceCheckUtils]: 36: Hoare triple {7788#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {7788#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {7788#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {7788#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {7788#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,530 INFO L290 TraceCheckUtils]: 41: Hoare triple {7788#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,530 INFO L290 TraceCheckUtils]: 42: Hoare triple {7788#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {7788#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,531 INFO L290 TraceCheckUtils]: 44: Hoare triple {7788#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {7788#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,531 INFO L290 TraceCheckUtils]: 46: Hoare triple {7788#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,531 INFO L290 TraceCheckUtils]: 47: Hoare triple {7788#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,531 INFO L290 TraceCheckUtils]: 48: Hoare triple {7788#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,531 INFO L290 TraceCheckUtils]: 49: Hoare triple {7788#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,531 INFO L290 TraceCheckUtils]: 50: Hoare triple {7788#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,531 INFO L290 TraceCheckUtils]: 51: Hoare triple {7788#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,531 INFO L290 TraceCheckUtils]: 52: Hoare triple {7788#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,531 INFO L290 TraceCheckUtils]: 53: Hoare triple {7788#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {7788#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,531 INFO L290 TraceCheckUtils]: 55: Hoare triple {7788#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {7788#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {7788#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,532 INFO L290 TraceCheckUtils]: 58: Hoare triple {7788#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {7788#false} is VALID [2022-04-27 15:40:42,532 INFO L290 TraceCheckUtils]: 59: Hoare triple {7788#false} assume 8641 == #t~mem76;havoc #t~mem76; {7788#false} is VALID [2022-04-27 15:40:42,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {7788#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {7788#false} is VALID [2022-04-27 15:40:42,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {7788#false} assume !(9 == ~blastFlag~0); {7788#false} is VALID [2022-04-27 15:40:42,532 INFO L290 TraceCheckUtils]: 62: Hoare triple {7788#false} assume !(12 == ~blastFlag~0); {7788#false} is VALID [2022-04-27 15:40:42,532 INFO L290 TraceCheckUtils]: 63: Hoare triple {7788#false} assume !false; {7788#false} is VALID [2022-04-27 15:40:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:40:42,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:40:42,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912131350] [2022-04-27 15:40:42,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912131350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:40:42,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:40:42,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:40:42,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604369143] [2022-04-27 15:40:42,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:40:42,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-27 15:40:42,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:40:42,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:42,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:42,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:40:42,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:40:42,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:40:42,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:40:42,595 INFO L87 Difference]: Start difference. First operand 215 states and 338 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:43,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:40:47,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:40:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:49,758 INFO L93 Difference]: Finished difference Result 509 states and 806 transitions. [2022-04-27 15:40:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:40:49,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-27 15:40:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:40:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2022-04-27 15:40:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2022-04-27 15:40:49,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 622 transitions. [2022-04-27 15:40:50,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 622 edges. 622 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:50,280 INFO L225 Difference]: With dead ends: 509 [2022-04-27 15:40:50,280 INFO L226 Difference]: Without dead ends: 320 [2022-04-27 15:40:50,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:40:50,281 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 151 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:40:50,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 376 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-27 15:40:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-04-27 15:40:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 216. [2022-04-27 15:40:50,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:40:50,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5781990521327014) internal successors, (333), 211 states have internal predecessors, (333), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:50,288 INFO L74 IsIncluded]: Start isIncluded. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5781990521327014) internal successors, (333), 211 states have internal predecessors, (333), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:50,289 INFO L87 Difference]: Start difference. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5781990521327014) internal successors, (333), 211 states have internal predecessors, (333), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:50,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:50,297 INFO L93 Difference]: Finished difference Result 320 states and 499 transitions. [2022-04-27 15:40:50,297 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 499 transitions. [2022-04-27 15:40:50,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:50,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:50,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.5781990521327014) internal successors, (333), 211 states have internal predecessors, (333), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 320 states. [2022-04-27 15:40:50,299 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.5781990521327014) internal successors, (333), 211 states have internal predecessors, (333), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 320 states. [2022-04-27 15:40:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:50,308 INFO L93 Difference]: Finished difference Result 320 states and 499 transitions. [2022-04-27 15:40:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 499 transitions. [2022-04-27 15:40:50,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:50,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:50,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:40:50,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:40:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.5781990521327014) internal successors, (333), 211 states have internal predecessors, (333), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 337 transitions. [2022-04-27 15:40:50,316 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 337 transitions. Word has length 64 [2022-04-27 15:40:50,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:40:50,316 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 337 transitions. [2022-04-27 15:40:50,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:50,316 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 337 transitions. [2022-04-27 15:40:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 15:40:50,317 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:40:50,317 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:40:50,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:40:50,317 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:40:50,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:40:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1481005359, now seen corresponding path program 1 times [2022-04-27 15:40:50,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:40:50,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886557910] [2022-04-27 15:40:50,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:40:50,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:40:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:50,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:40:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:50,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {9286#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9279#true} is VALID [2022-04-27 15:40:50,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {9279#true} assume true; {9279#true} is VALID [2022-04-27 15:40:50,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9279#true} {9279#true} #720#return; {9279#true} is VALID [2022-04-27 15:40:50,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {9279#true} call ULTIMATE.init(); {9286#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:40:50,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {9286#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9279#true} is VALID [2022-04-27 15:40:50,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {9279#true} assume true; {9279#true} is VALID [2022-04-27 15:40:50,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9279#true} {9279#true} #720#return; {9279#true} is VALID [2022-04-27 15:40:50,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {9279#true} call #t~ret161 := main(); {9279#true} is VALID [2022-04-27 15:40:50,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {9279#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9279#true} is VALID [2022-04-27 15:40:50,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {9279#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9279#true} is VALID [2022-04-27 15:40:50,447 INFO L272 TraceCheckUtils]: 7: Hoare triple {9279#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9279#true} is VALID [2022-04-27 15:40:50,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {9279#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:50,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:50,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:50,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:50,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:50,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:50,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:50,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:50,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:40:50,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {9284#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9285#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-27 15:40:50,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {9285#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {9280#false} is VALID [2022-04-27 15:40:50,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {9280#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {9280#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9280#false} is VALID [2022-04-27 15:40:50,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {9280#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {9280#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {9280#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {9280#false} is VALID [2022-04-27 15:40:50,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {9280#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {9280#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {9280#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {9280#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9280#false} is VALID [2022-04-27 15:40:50,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {9280#false} ~skip~0 := 0; {9280#false} is VALID [2022-04-27 15:40:50,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {9280#false} assume !false; {9280#false} is VALID [2022-04-27 15:40:50,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {9280#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {9280#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {9280#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {9280#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {9280#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {9280#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {9280#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {9280#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {9280#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {9280#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {9280#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {9280#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {9280#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {9280#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {9280#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,458 INFO L290 TraceCheckUtils]: 45: Hoare triple {9280#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,458 INFO L290 TraceCheckUtils]: 46: Hoare triple {9280#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,458 INFO L290 TraceCheckUtils]: 47: Hoare triple {9280#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,458 INFO L290 TraceCheckUtils]: 48: Hoare triple {9280#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,458 INFO L290 TraceCheckUtils]: 49: Hoare triple {9280#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,458 INFO L290 TraceCheckUtils]: 50: Hoare triple {9280#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,458 INFO L290 TraceCheckUtils]: 51: Hoare triple {9280#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,458 INFO L290 TraceCheckUtils]: 52: Hoare triple {9280#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,459 INFO L290 TraceCheckUtils]: 53: Hoare triple {9280#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,459 INFO L290 TraceCheckUtils]: 54: Hoare triple {9280#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,459 INFO L290 TraceCheckUtils]: 55: Hoare triple {9280#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,459 INFO L290 TraceCheckUtils]: 56: Hoare triple {9280#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,459 INFO L290 TraceCheckUtils]: 57: Hoare triple {9280#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,459 INFO L290 TraceCheckUtils]: 58: Hoare triple {9280#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,459 INFO L290 TraceCheckUtils]: 59: Hoare triple {9280#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {9280#false} is VALID [2022-04-27 15:40:50,459 INFO L290 TraceCheckUtils]: 60: Hoare triple {9280#false} assume 8641 == #t~mem76;havoc #t~mem76; {9280#false} is VALID [2022-04-27 15:40:50,459 INFO L290 TraceCheckUtils]: 61: Hoare triple {9280#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9280#false} is VALID [2022-04-27 15:40:50,459 INFO L290 TraceCheckUtils]: 62: Hoare triple {9280#false} assume !(9 == ~blastFlag~0); {9280#false} is VALID [2022-04-27 15:40:50,459 INFO L290 TraceCheckUtils]: 63: Hoare triple {9280#false} assume !(12 == ~blastFlag~0); {9280#false} is VALID [2022-04-27 15:40:50,460 INFO L290 TraceCheckUtils]: 64: Hoare triple {9280#false} assume !false; {9280#false} is VALID [2022-04-27 15:40:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:40:50,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:40:50,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886557910] [2022-04-27 15:40:50,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886557910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:40:50,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:40:50,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:40:50,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584103791] [2022-04-27 15:40:50,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:40:50,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-27 15:40:50,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:40:50,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:50,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:50,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:40:50,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:40:50,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:40:50,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:40:50,534 INFO L87 Difference]: Start difference. First operand 216 states and 337 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:57,635 INFO L93 Difference]: Finished difference Result 510 states and 803 transitions. [2022-04-27 15:40:57,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:40:57,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-27 15:40:57,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:40:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2022-04-27 15:40:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2022-04-27 15:40:57,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 621 transitions. [2022-04-27 15:40:58,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 621 edges. 621 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:58,178 INFO L225 Difference]: With dead ends: 510 [2022-04-27 15:40:58,178 INFO L226 Difference]: Without dead ends: 320 [2022-04-27 15:40:58,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:40:58,179 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 155 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:40:58,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 376 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:40:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-04-27 15:40:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 216. [2022-04-27 15:40:58,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:40:58,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5639810426540284) internal successors, (330), 211 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:58,201 INFO L74 IsIncluded]: Start isIncluded. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5639810426540284) internal successors, (330), 211 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:58,201 INFO L87 Difference]: Start difference. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5639810426540284) internal successors, (330), 211 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:58,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:58,208 INFO L93 Difference]: Finished difference Result 320 states and 496 transitions. [2022-04-27 15:40:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 496 transitions. [2022-04-27 15:40:58,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:58,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:58,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.5639810426540284) internal successors, (330), 211 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 320 states. [2022-04-27 15:40:58,213 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.5639810426540284) internal successors, (330), 211 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 320 states. [2022-04-27 15:40:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:40:58,219 INFO L93 Difference]: Finished difference Result 320 states and 496 transitions. [2022-04-27 15:40:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 496 transitions. [2022-04-27 15:40:58,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:40:58,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:40:58,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:40:58,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:40:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.5639810426540284) internal successors, (330), 211 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 334 transitions. [2022-04-27 15:40:58,224 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 334 transitions. Word has length 65 [2022-04-27 15:40:58,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:40:58,225 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 334 transitions. [2022-04-27 15:40:58,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 334 transitions. [2022-04-27 15:40:58,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 15:40:58,226 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:40:58,226 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:40:58,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:40:58,226 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:40:58,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:40:58,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1940444079, now seen corresponding path program 1 times [2022-04-27 15:40:58,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:40:58,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231566350] [2022-04-27 15:40:58,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:40:58,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:40:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:58,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:40:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:40:58,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {10779#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10772#true} is VALID [2022-04-27 15:40:58,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {10772#true} assume true; {10772#true} is VALID [2022-04-27 15:40:58,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10772#true} {10772#true} #720#return; {10772#true} is VALID [2022-04-27 15:40:58,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {10772#true} call ULTIMATE.init(); {10779#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:40:58,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {10779#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10772#true} is VALID [2022-04-27 15:40:58,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {10772#true} assume true; {10772#true} is VALID [2022-04-27 15:40:58,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10772#true} {10772#true} #720#return; {10772#true} is VALID [2022-04-27 15:40:58,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {10772#true} call #t~ret161 := main(); {10772#true} is VALID [2022-04-27 15:40:58,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {10772#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {10772#true} is VALID [2022-04-27 15:40:58,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {10772#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {10772#true} is VALID [2022-04-27 15:40:58,372 INFO L272 TraceCheckUtils]: 7: Hoare triple {10772#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10772#true} is VALID [2022-04-27 15:40:58,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {10772#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:58,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:58,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:58,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:58,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:58,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:58,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:58,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:58,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:58,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:40:58,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {10777#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10778#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-27 15:40:58,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {10778#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {10773#false} is VALID [2022-04-27 15:40:58,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {10773#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {10773#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {10773#false} is VALID [2022-04-27 15:40:58,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {10773#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {10773#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {10773#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {10773#false} is VALID [2022-04-27 15:40:58,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {10773#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {10773#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {10773#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {10773#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {10773#false} is VALID [2022-04-27 15:40:58,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {10773#false} ~skip~0 := 0; {10773#false} is VALID [2022-04-27 15:40:58,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {10773#false} assume !false; {10773#false} is VALID [2022-04-27 15:40:58,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {10773#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {10773#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {10773#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {10773#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {10773#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {10773#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {10773#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {10773#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {10773#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {10773#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {10773#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {10773#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {10773#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {10773#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {10773#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {10773#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {10773#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {10773#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,382 INFO L290 TraceCheckUtils]: 49: Hoare triple {10773#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,382 INFO L290 TraceCheckUtils]: 50: Hoare triple {10773#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,382 INFO L290 TraceCheckUtils]: 51: Hoare triple {10773#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,382 INFO L290 TraceCheckUtils]: 52: Hoare triple {10773#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {10773#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,383 INFO L290 TraceCheckUtils]: 54: Hoare triple {10773#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,383 INFO L290 TraceCheckUtils]: 55: Hoare triple {10773#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,383 INFO L290 TraceCheckUtils]: 56: Hoare triple {10773#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,383 INFO L290 TraceCheckUtils]: 57: Hoare triple {10773#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {10773#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {10773#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,383 INFO L290 TraceCheckUtils]: 60: Hoare triple {10773#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {10773#false} is VALID [2022-04-27 15:40:58,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {10773#false} assume 8641 == #t~mem76;havoc #t~mem76; {10773#false} is VALID [2022-04-27 15:40:58,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {10773#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {10773#false} is VALID [2022-04-27 15:40:58,383 INFO L290 TraceCheckUtils]: 63: Hoare triple {10773#false} assume !(9 == ~blastFlag~0); {10773#false} is VALID [2022-04-27 15:40:58,383 INFO L290 TraceCheckUtils]: 64: Hoare triple {10773#false} assume !(12 == ~blastFlag~0); {10773#false} is VALID [2022-04-27 15:40:58,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {10773#false} assume !false; {10773#false} is VALID [2022-04-27 15:40:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:40:58,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:40:58,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231566350] [2022-04-27 15:40:58,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231566350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:40:58,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:40:58,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:40:58,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355679590] [2022-04-27 15:40:58,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:40:58,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-27 15:40:58,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:40:58,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:40:58,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:40:58,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:40:58,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:40:58,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:40:58,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:40:58,452 INFO L87 Difference]: Start difference. First operand 216 states and 334 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:01,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:41:03,323 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:41:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:06,054 INFO L93 Difference]: Finished difference Result 419 states and 653 transitions. [2022-04-27 15:41:06,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:41:06,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-27 15:41:06,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:41:06,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-27 15:41:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-27 15:41:06,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-27 15:41:06,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:06,447 INFO L225 Difference]: With dead ends: 419 [2022-04-27 15:41:06,448 INFO L226 Difference]: Without dead ends: 229 [2022-04-27 15:41:06,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:41:06,449 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 20 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:41:06,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 521 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 364 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2022-04-27 15:41:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-04-27 15:41:06,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 216. [2022-04-27 15:41:06,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:41:06,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 216 states, 211 states have (on average 1.5592417061611374) internal successors, (329), 211 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:06,455 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 216 states, 211 states have (on average 1.5592417061611374) internal successors, (329), 211 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:06,455 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 216 states, 211 states have (on average 1.5592417061611374) internal successors, (329), 211 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:06,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:06,459 INFO L93 Difference]: Finished difference Result 229 states and 350 transitions. [2022-04-27 15:41:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 350 transitions. [2022-04-27 15:41:06,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:06,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:06,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.5592417061611374) internal successors, (329), 211 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 229 states. [2022-04-27 15:41:06,460 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.5592417061611374) internal successors, (329), 211 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 229 states. [2022-04-27 15:41:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:06,464 INFO L93 Difference]: Finished difference Result 229 states and 350 transitions. [2022-04-27 15:41:06,464 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 350 transitions. [2022-04-27 15:41:06,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:06,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:06,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:41:06,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:41:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.5592417061611374) internal successors, (329), 211 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 333 transitions. [2022-04-27 15:41:06,469 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 333 transitions. Word has length 66 [2022-04-27 15:41:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:41:06,469 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 333 transitions. [2022-04-27 15:41:06,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 333 transitions. [2022-04-27 15:41:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-27 15:41:06,470 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:41:06,470 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-27 15:41:06,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:41:06,471 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:41:06,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:41:06,471 INFO L85 PathProgramCache]: Analyzing trace with hash 267937908, now seen corresponding path program 1 times [2022-04-27 15:41:06,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:41:06,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223500994] [2022-04-27 15:41:06,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:41:06,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:41:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:06,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:41:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:06,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {11981#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {11974#true} is VALID [2022-04-27 15:41:06,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {11974#true} assume true; {11974#true} is VALID [2022-04-27 15:41:06,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11974#true} {11974#true} #720#return; {11974#true} is VALID [2022-04-27 15:41:06,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {11974#true} call ULTIMATE.init(); {11981#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:41:06,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {11981#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {11974#true} is VALID [2022-04-27 15:41:06,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {11974#true} assume true; {11974#true} is VALID [2022-04-27 15:41:06,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11974#true} {11974#true} #720#return; {11974#true} is VALID [2022-04-27 15:41:06,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {11974#true} call #t~ret161 := main(); {11974#true} is VALID [2022-04-27 15:41:06,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {11974#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {11974#true} is VALID [2022-04-27 15:41:06,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {11974#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {11974#true} is VALID [2022-04-27 15:41:06,602 INFO L272 TraceCheckUtils]: 7: Hoare triple {11974#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11974#true} is VALID [2022-04-27 15:41:06,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {11974#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:06,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:06,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:06,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:06,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:06,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:06,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:06,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:06,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:06,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:06,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:06,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {11979#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11980#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-27 15:41:06,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {11980#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {11975#false} is VALID [2022-04-27 15:41:06,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {11975#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {11975#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11975#false} is VALID [2022-04-27 15:41:06,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {11975#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {11975#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {11975#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {11975#false} is VALID [2022-04-27 15:41:06,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {11975#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {11975#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {11975#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {11975#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {11975#false} is VALID [2022-04-27 15:41:06,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {11975#false} ~skip~0 := 0; {11975#false} is VALID [2022-04-27 15:41:06,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {11975#false} assume !false; {11975#false} is VALID [2022-04-27 15:41:06,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {11975#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {11975#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {11975#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {11975#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,611 INFO L290 TraceCheckUtils]: 36: Hoare triple {11975#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {11975#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {11975#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {11975#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {11975#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {11975#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {11975#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {11975#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {11975#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {11975#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,612 INFO L290 TraceCheckUtils]: 46: Hoare triple {11975#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,612 INFO L290 TraceCheckUtils]: 47: Hoare triple {11975#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,612 INFO L290 TraceCheckUtils]: 48: Hoare triple {11975#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,612 INFO L290 TraceCheckUtils]: 49: Hoare triple {11975#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,612 INFO L290 TraceCheckUtils]: 50: Hoare triple {11975#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,612 INFO L290 TraceCheckUtils]: 51: Hoare triple {11975#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,612 INFO L290 TraceCheckUtils]: 52: Hoare triple {11975#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,612 INFO L290 TraceCheckUtils]: 53: Hoare triple {11975#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,612 INFO L290 TraceCheckUtils]: 54: Hoare triple {11975#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,612 INFO L290 TraceCheckUtils]: 55: Hoare triple {11975#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,612 INFO L290 TraceCheckUtils]: 56: Hoare triple {11975#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,613 INFO L290 TraceCheckUtils]: 57: Hoare triple {11975#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,613 INFO L290 TraceCheckUtils]: 58: Hoare triple {11975#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,613 INFO L290 TraceCheckUtils]: 59: Hoare triple {11975#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,613 INFO L290 TraceCheckUtils]: 60: Hoare triple {11975#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,613 INFO L290 TraceCheckUtils]: 61: Hoare triple {11975#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {11975#false} is VALID [2022-04-27 15:41:06,613 INFO L290 TraceCheckUtils]: 62: Hoare triple {11975#false} assume 8641 == #t~mem76;havoc #t~mem76; {11975#false} is VALID [2022-04-27 15:41:06,613 INFO L290 TraceCheckUtils]: 63: Hoare triple {11975#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {11975#false} is VALID [2022-04-27 15:41:06,613 INFO L290 TraceCheckUtils]: 64: Hoare triple {11975#false} assume !(9 == ~blastFlag~0); {11975#false} is VALID [2022-04-27 15:41:06,613 INFO L290 TraceCheckUtils]: 65: Hoare triple {11975#false} assume !(12 == ~blastFlag~0); {11975#false} is VALID [2022-04-27 15:41:06,613 INFO L290 TraceCheckUtils]: 66: Hoare triple {11975#false} assume !false; {11975#false} is VALID [2022-04-27 15:41:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:41:06,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:41:06,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223500994] [2022-04-27 15:41:06,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223500994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:41:06,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:41:06,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:41:06,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989941790] [2022-04-27 15:41:06,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:41:06,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-27 15:41:06,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:41:06,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:06,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:06,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:41:06,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:41:06,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:41:06,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:41:06,675 INFO L87 Difference]: Start difference. First operand 216 states and 333 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:09,568 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:41:11,940 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:41:14,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:14,391 INFO L93 Difference]: Finished difference Result 510 states and 797 transitions. [2022-04-27 15:41:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:41:14,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-27 15:41:14,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:41:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 620 transitions. [2022-04-27 15:41:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 620 transitions. [2022-04-27 15:41:14,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 620 transitions. [2022-04-27 15:41:14,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 620 edges. 620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:14,894 INFO L225 Difference]: With dead ends: 510 [2022-04-27 15:41:14,894 INFO L226 Difference]: Without dead ends: 320 [2022-04-27 15:41:14,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:41:14,895 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 152 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:41:14,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 376 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-27 15:41:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-04-27 15:41:14,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 216. [2022-04-27 15:41:14,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:41:14,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:14,901 INFO L74 IsIncluded]: Start isIncluded. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:14,901 INFO L87 Difference]: Start difference. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:14,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:14,908 INFO L93 Difference]: Finished difference Result 320 states and 492 transitions. [2022-04-27 15:41:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 492 transitions. [2022-04-27 15:41:14,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:14,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:14,909 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 320 states. [2022-04-27 15:41:14,909 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 320 states. [2022-04-27 15:41:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:14,915 INFO L93 Difference]: Finished difference Result 320 states and 492 transitions. [2022-04-27 15:41:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 492 transitions. [2022-04-27 15:41:14,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:14,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:14,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:41:14,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:41:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 330 transitions. [2022-04-27 15:41:14,921 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 330 transitions. Word has length 67 [2022-04-27 15:41:14,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:41:14,921 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 330 transitions. [2022-04-27 15:41:14,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 330 transitions. [2022-04-27 15:41:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-27 15:41:14,922 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:41:14,922 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-04-27 15:41:14,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:41:14,922 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:41:14,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:41:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash -792632163, now seen corresponding path program 1 times [2022-04-27 15:41:14,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:41:14,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398489453] [2022-04-27 15:41:14,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:41:14,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:41:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:41:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:15,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {13474#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13467#true} is VALID [2022-04-27 15:41:15,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {13467#true} assume true; {13467#true} is VALID [2022-04-27 15:41:15,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13467#true} {13467#true} #720#return; {13467#true} is VALID [2022-04-27 15:41:15,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {13467#true} call ULTIMATE.init(); {13474#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:41:15,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {13474#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13467#true} is VALID [2022-04-27 15:41:15,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {13467#true} assume true; {13467#true} is VALID [2022-04-27 15:41:15,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13467#true} {13467#true} #720#return; {13467#true} is VALID [2022-04-27 15:41:15,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {13467#true} call #t~ret161 := main(); {13467#true} is VALID [2022-04-27 15:41:15,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {13467#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {13467#true} is VALID [2022-04-27 15:41:15,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {13467#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {13467#true} is VALID [2022-04-27 15:41:15,045 INFO L272 TraceCheckUtils]: 7: Hoare triple {13467#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13467#true} is VALID [2022-04-27 15:41:15,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {13467#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13467#true} is VALID [2022-04-27 15:41:15,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {13467#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {13467#true} is VALID [2022-04-27 15:41:15,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {13467#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {13467#true} is VALID [2022-04-27 15:41:15,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {13467#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13467#true} is VALID [2022-04-27 15:41:15,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {13467#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {13467#true} is VALID [2022-04-27 15:41:15,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {13467#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {13467#true} is VALID [2022-04-27 15:41:15,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {13467#true} assume !false; {13467#true} is VALID [2022-04-27 15:41:15,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {13467#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13467#true} is VALID [2022-04-27 15:41:15,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {13467#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13467#true} is VALID [2022-04-27 15:41:15,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {13467#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13467#true} is VALID [2022-04-27 15:41:15,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {13467#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13467#true} is VALID [2022-04-27 15:41:15,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {13467#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13467#true} is VALID [2022-04-27 15:41:15,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {13467#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13467#true} is VALID [2022-04-27 15:41:15,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {13467#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13467#true} is VALID [2022-04-27 15:41:15,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {13467#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13467#true} is VALID [2022-04-27 15:41:15,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {13467#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13467#true} is VALID [2022-04-27 15:41:15,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {13467#true} assume 8464 == #t~mem55;havoc #t~mem55; {13467#true} is VALID [2022-04-27 15:41:15,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {13467#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {13467#true} is VALID [2022-04-27 15:41:15,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {13467#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13467#true} is VALID [2022-04-27 15:41:15,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {13467#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:15,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {13472#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13473#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-27 15:41:15,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {13473#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {13468#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {13468#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,055 INFO L290 TraceCheckUtils]: 47: Hoare triple {13468#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {13468#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {13468#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {13468#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,055 INFO L290 TraceCheckUtils]: 51: Hoare triple {13468#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,055 INFO L290 TraceCheckUtils]: 52: Hoare triple {13468#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {13468#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,056 INFO L290 TraceCheckUtils]: 54: Hoare triple {13468#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,056 INFO L290 TraceCheckUtils]: 55: Hoare triple {13468#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {13468#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {13468#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {13468#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {13468#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,056 INFO L290 TraceCheckUtils]: 60: Hoare triple {13468#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {13468#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {13468#false} is VALID [2022-04-27 15:41:15,056 INFO L290 TraceCheckUtils]: 62: Hoare triple {13468#false} assume 8641 == #t~mem76;havoc #t~mem76; {13468#false} is VALID [2022-04-27 15:41:15,056 INFO L290 TraceCheckUtils]: 63: Hoare triple {13468#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {13468#false} is VALID [2022-04-27 15:41:15,056 INFO L290 TraceCheckUtils]: 64: Hoare triple {13468#false} assume !(9 == ~blastFlag~0); {13468#false} is VALID [2022-04-27 15:41:15,057 INFO L290 TraceCheckUtils]: 65: Hoare triple {13468#false} assume !(12 == ~blastFlag~0); {13468#false} is VALID [2022-04-27 15:41:15,057 INFO L290 TraceCheckUtils]: 66: Hoare triple {13468#false} assume !false; {13468#false} is VALID [2022-04-27 15:41:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:41:15,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:41:15,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398489453] [2022-04-27 15:41:15,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398489453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:41:15,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:41:15,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:41:15,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998219543] [2022-04-27 15:41:15,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:41:15,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-27 15:41:15,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:41:15,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:15,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:15,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:41:15,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:41:15,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:41:15,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:41:15,116 INFO L87 Difference]: Start difference. First operand 216 states and 330 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:17,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:41:19,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:41:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:22,382 INFO L93 Difference]: Finished difference Result 448 states and 690 transitions. [2022-04-27 15:41:22,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:41:22,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-27 15:41:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:41:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2022-04-27 15:41:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:22,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2022-04-27 15:41:22,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 491 transitions. [2022-04-27 15:41:22,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:22,711 INFO L225 Difference]: With dead ends: 448 [2022-04-27 15:41:22,711 INFO L226 Difference]: Without dead ends: 258 [2022-04-27 15:41:22,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:41:22,712 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 29 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:41:22,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 535 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 404 Invalid, 2 Unknown, 0 Unchecked, 5.8s Time] [2022-04-27 15:41:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-04-27 15:41:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 238. [2022-04-27 15:41:22,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:41:22,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 238 states, 233 states have (on average 1.5407725321888412) internal successors, (359), 233 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:22,718 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 238 states, 233 states have (on average 1.5407725321888412) internal successors, (359), 233 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:22,719 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 238 states, 233 states have (on average 1.5407725321888412) internal successors, (359), 233 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:22,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:22,723 INFO L93 Difference]: Finished difference Result 258 states and 389 transitions. [2022-04-27 15:41:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 389 transitions. [2022-04-27 15:41:22,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:22,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:22,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 233 states have (on average 1.5407725321888412) internal successors, (359), 233 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 258 states. [2022-04-27 15:41:22,724 INFO L87 Difference]: Start difference. First operand has 238 states, 233 states have (on average 1.5407725321888412) internal successors, (359), 233 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 258 states. [2022-04-27 15:41:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:22,729 INFO L93 Difference]: Finished difference Result 258 states and 389 transitions. [2022-04-27 15:41:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 389 transitions. [2022-04-27 15:41:22,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:22,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:22,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:41:22,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:41:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 1.5407725321888412) internal successors, (359), 233 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 363 transitions. [2022-04-27 15:41:22,734 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 363 transitions. Word has length 67 [2022-04-27 15:41:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:41:22,735 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 363 transitions. [2022-04-27 15:41:22,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 363 transitions. [2022-04-27 15:41:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-27 15:41:22,736 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:41:22,736 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-04-27 15:41:22,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:41:22,736 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:41:22,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:41:22,736 INFO L85 PathProgramCache]: Analyzing trace with hash -392094106, now seen corresponding path program 1 times [2022-04-27 15:41:22,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:41:22,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135305304] [2022-04-27 15:41:22,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:41:22,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:41:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:22,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:41:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:22,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {14792#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14785#true} is VALID [2022-04-27 15:41:22,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {14785#true} assume true; {14785#true} is VALID [2022-04-27 15:41:22,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14785#true} {14785#true} #720#return; {14785#true} is VALID [2022-04-27 15:41:22,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {14785#true} call ULTIMATE.init(); {14792#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:41:22,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {14792#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14785#true} is VALID [2022-04-27 15:41:22,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {14785#true} assume true; {14785#true} is VALID [2022-04-27 15:41:22,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14785#true} {14785#true} #720#return; {14785#true} is VALID [2022-04-27 15:41:22,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {14785#true} call #t~ret161 := main(); {14785#true} is VALID [2022-04-27 15:41:22,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {14785#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {14785#true} is VALID [2022-04-27 15:41:22,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {14785#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {14785#true} is VALID [2022-04-27 15:41:22,873 INFO L272 TraceCheckUtils]: 7: Hoare triple {14785#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14785#true} is VALID [2022-04-27 15:41:22,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {14785#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {14785#true} is VALID [2022-04-27 15:41:22,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {14785#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {14785#true} is VALID [2022-04-27 15:41:22,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {14785#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {14785#true} is VALID [2022-04-27 15:41:22,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {14785#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14785#true} is VALID [2022-04-27 15:41:22,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {14785#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {14785#true} is VALID [2022-04-27 15:41:22,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {14785#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {14785#true} is VALID [2022-04-27 15:41:22,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {14785#true} assume !false; {14785#true} is VALID [2022-04-27 15:41:22,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {14785#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14785#true} is VALID [2022-04-27 15:41:22,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {14785#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14785#true} is VALID [2022-04-27 15:41:22,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {14785#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14785#true} is VALID [2022-04-27 15:41:22,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {14785#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14785#true} is VALID [2022-04-27 15:41:22,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {14785#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14785#true} is VALID [2022-04-27 15:41:22,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {14785#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14785#true} is VALID [2022-04-27 15:41:22,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {14785#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14785#true} is VALID [2022-04-27 15:41:22,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {14785#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14785#true} is VALID [2022-04-27 15:41:22,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {14785#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14785#true} is VALID [2022-04-27 15:41:22,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {14785#true} assume 8464 == #t~mem55;havoc #t~mem55; {14785#true} is VALID [2022-04-27 15:41:22,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {14785#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {14785#true} is VALID [2022-04-27 15:41:22,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {14785#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14785#true} is VALID [2022-04-27 15:41:22,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {14785#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:22,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:22,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:22,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:22,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:22,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:22,879 INFO L290 TraceCheckUtils]: 33: Hoare triple {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:22,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:22,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:22,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:22,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {14790#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14791#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-27 15:41:22,881 INFO L290 TraceCheckUtils]: 38: Hoare triple {14791#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {14786#false} is VALID [2022-04-27 15:41:22,881 INFO L290 TraceCheckUtils]: 39: Hoare triple {14786#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {14786#false} is VALID [2022-04-27 15:41:22,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {14786#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,881 INFO L290 TraceCheckUtils]: 41: Hoare triple {14786#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {14786#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14786#false} is VALID [2022-04-27 15:41:22,881 INFO L290 TraceCheckUtils]: 43: Hoare triple {14786#false} ~skip~0 := 0; {14786#false} is VALID [2022-04-27 15:41:22,881 INFO L290 TraceCheckUtils]: 44: Hoare triple {14786#false} assume !false; {14786#false} is VALID [2022-04-27 15:41:22,881 INFO L290 TraceCheckUtils]: 45: Hoare triple {14786#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,881 INFO L290 TraceCheckUtils]: 46: Hoare triple {14786#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,881 INFO L290 TraceCheckUtils]: 47: Hoare triple {14786#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {14786#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,882 INFO L290 TraceCheckUtils]: 49: Hoare triple {14786#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,882 INFO L290 TraceCheckUtils]: 50: Hoare triple {14786#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {14786#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {14786#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {14786#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,882 INFO L290 TraceCheckUtils]: 54: Hoare triple {14786#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {14786#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {14786#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {14786#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,882 INFO L290 TraceCheckUtils]: 58: Hoare triple {14786#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {14786#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,883 INFO L290 TraceCheckUtils]: 60: Hoare triple {14786#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,883 INFO L290 TraceCheckUtils]: 61: Hoare triple {14786#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,883 INFO L290 TraceCheckUtils]: 62: Hoare triple {14786#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,883 INFO L290 TraceCheckUtils]: 63: Hoare triple {14786#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,883 INFO L290 TraceCheckUtils]: 64: Hoare triple {14786#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {14786#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,883 INFO L290 TraceCheckUtils]: 66: Hoare triple {14786#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,883 INFO L290 TraceCheckUtils]: 67: Hoare triple {14786#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,883 INFO L290 TraceCheckUtils]: 68: Hoare triple {14786#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,883 INFO L290 TraceCheckUtils]: 69: Hoare triple {14786#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,883 INFO L290 TraceCheckUtils]: 70: Hoare triple {14786#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,884 INFO L290 TraceCheckUtils]: 71: Hoare triple {14786#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,884 INFO L290 TraceCheckUtils]: 72: Hoare triple {14786#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,884 INFO L290 TraceCheckUtils]: 73: Hoare triple {14786#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,884 INFO L290 TraceCheckUtils]: 74: Hoare triple {14786#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {14786#false} is VALID [2022-04-27 15:41:22,884 INFO L290 TraceCheckUtils]: 75: Hoare triple {14786#false} assume 8641 == #t~mem76;havoc #t~mem76; {14786#false} is VALID [2022-04-27 15:41:22,884 INFO L290 TraceCheckUtils]: 76: Hoare triple {14786#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {14786#false} is VALID [2022-04-27 15:41:22,884 INFO L290 TraceCheckUtils]: 77: Hoare triple {14786#false} assume !(9 == ~blastFlag~0); {14786#false} is VALID [2022-04-27 15:41:22,884 INFO L290 TraceCheckUtils]: 78: Hoare triple {14786#false} assume !(12 == ~blastFlag~0); {14786#false} is VALID [2022-04-27 15:41:22,884 INFO L290 TraceCheckUtils]: 79: Hoare triple {14786#false} assume !false; {14786#false} is VALID [2022-04-27 15:41:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:41:22,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:41:22,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135305304] [2022-04-27 15:41:22,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135305304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:41:22,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:41:22,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:41:22,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490292113] [2022-04-27 15:41:22,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:41:22,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-27 15:41:22,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:41:22,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:22,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:22,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:41:22,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:41:22,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:41:22,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:41:22,955 INFO L87 Difference]: Start difference. First operand 238 states and 363 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:25,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:41:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:28,629 INFO L93 Difference]: Finished difference Result 468 states and 720 transitions. [2022-04-27 15:41:28,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:41:28,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-27 15:41:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:41:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2022-04-27 15:41:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2022-04-27 15:41:28,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 488 transitions. [2022-04-27 15:41:28,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:28,959 INFO L225 Difference]: With dead ends: 468 [2022-04-27 15:41:28,959 INFO L226 Difference]: Without dead ends: 256 [2022-04-27 15:41:28,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:41:28,960 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 34 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:41:28,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 539 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-27 15:41:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-27 15:41:28,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2022-04-27 15:41:28,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:41:28,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 238 states, 233 states have (on average 1.536480686695279) internal successors, (358), 233 states have internal predecessors, (358), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:28,966 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 238 states, 233 states have (on average 1.536480686695279) internal successors, (358), 233 states have internal predecessors, (358), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:28,966 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 238 states, 233 states have (on average 1.536480686695279) internal successors, (358), 233 states have internal predecessors, (358), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:28,970 INFO L93 Difference]: Finished difference Result 256 states and 386 transitions. [2022-04-27 15:41:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 386 transitions. [2022-04-27 15:41:28,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:28,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:28,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 233 states have (on average 1.536480686695279) internal successors, (358), 233 states have internal predecessors, (358), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 256 states. [2022-04-27 15:41:28,972 INFO L87 Difference]: Start difference. First operand has 238 states, 233 states have (on average 1.536480686695279) internal successors, (358), 233 states have internal predecessors, (358), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 256 states. [2022-04-27 15:41:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:28,976 INFO L93 Difference]: Finished difference Result 256 states and 386 transitions. [2022-04-27 15:41:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 386 transitions. [2022-04-27 15:41:28,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:28,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:28,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:41:28,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:41:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 1.536480686695279) internal successors, (358), 233 states have internal predecessors, (358), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 362 transitions. [2022-04-27 15:41:28,982 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 362 transitions. Word has length 80 [2022-04-27 15:41:28,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:41:28,982 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 362 transitions. [2022-04-27 15:41:28,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:28,982 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 362 transitions. [2022-04-27 15:41:28,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-27 15:41:28,983 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:41:28,983 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:41:28,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:41:28,983 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:41:28,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:41:28,984 INFO L85 PathProgramCache]: Analyzing trace with hash 334207830, now seen corresponding path program 1 times [2022-04-27 15:41:28,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:41:28,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464209014] [2022-04-27 15:41:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:41:28,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:41:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:29,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:41:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:29,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {16127#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16120#true} is VALID [2022-04-27 15:41:29,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {16120#true} assume true; {16120#true} is VALID [2022-04-27 15:41:29,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16120#true} {16120#true} #720#return; {16120#true} is VALID [2022-04-27 15:41:29,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {16120#true} call ULTIMATE.init(); {16127#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:41:29,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {16127#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16120#true} is VALID [2022-04-27 15:41:29,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {16120#true} assume true; {16120#true} is VALID [2022-04-27 15:41:29,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16120#true} {16120#true} #720#return; {16120#true} is VALID [2022-04-27 15:41:29,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {16120#true} call #t~ret161 := main(); {16120#true} is VALID [2022-04-27 15:41:29,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {16120#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16120#true} is VALID [2022-04-27 15:41:29,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {16120#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,112 INFO L272 TraceCheckUtils]: 7: Hoare triple {16120#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16120#true} is VALID [2022-04-27 15:41:29,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {16120#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {16120#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16120#true} is VALID [2022-04-27 15:41:29,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {16120#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {16120#true} is VALID [2022-04-27 15:41:29,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {16120#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16120#true} is VALID [2022-04-27 15:41:29,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {16120#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {16120#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {16120#true} is VALID [2022-04-27 15:41:29,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {16120#true} assume !false; {16120#true} is VALID [2022-04-27 15:41:29,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {16120#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {16120#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {16120#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {16120#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {16120#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {16120#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {16120#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {16120#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {16120#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {16120#true} assume 8464 == #t~mem55;havoc #t~mem55; {16120#true} is VALID [2022-04-27 15:41:29,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {16120#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {16120#true} is VALID [2022-04-27 15:41:29,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {16120#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16120#true} is VALID [2022-04-27 15:41:29,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {16120#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {16120#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {16120#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16120#true} is VALID [2022-04-27 15:41:29,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {16120#true} ~skip~0 := 0; {16120#true} is VALID [2022-04-27 15:41:29,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {16120#true} assume !false; {16120#true} is VALID [2022-04-27 15:41:29,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {16120#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {16120#true} assume 12292 == #t~mem47;havoc #t~mem47; {16120#true} is VALID [2022-04-27 15:41:29,115 INFO L290 TraceCheckUtils]: 34: Hoare triple {16120#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,115 INFO L290 TraceCheckUtils]: 35: Hoare triple {16120#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {16120#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16120#true} is VALID [2022-04-27 15:41:29,115 INFO L290 TraceCheckUtils]: 37: Hoare triple {16120#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {16120#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,115 INFO L290 TraceCheckUtils]: 39: Hoare triple {16120#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {16120#true} is VALID [2022-04-27 15:41:29,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {16120#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {16120#true} is VALID [2022-04-27 15:41:29,117 INFO L290 TraceCheckUtils]: 41: Hoare triple {16120#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:29,118 INFO L290 TraceCheckUtils]: 42: Hoare triple {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:29,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:29,119 INFO L290 TraceCheckUtils]: 44: Hoare triple {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:29,119 INFO L290 TraceCheckUtils]: 45: Hoare triple {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:29,119 INFO L290 TraceCheckUtils]: 46: Hoare triple {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:29,120 INFO L290 TraceCheckUtils]: 47: Hoare triple {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:29,120 INFO L290 TraceCheckUtils]: 48: Hoare triple {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:29,120 INFO L290 TraceCheckUtils]: 49: Hoare triple {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:29,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:29,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {16125#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16126#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-27 15:41:29,122 INFO L290 TraceCheckUtils]: 52: Hoare triple {16126#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,122 INFO L290 TraceCheckUtils]: 53: Hoare triple {16121#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,122 INFO L290 TraceCheckUtils]: 54: Hoare triple {16121#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,122 INFO L290 TraceCheckUtils]: 55: Hoare triple {16121#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,122 INFO L290 TraceCheckUtils]: 56: Hoare triple {16121#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,122 INFO L290 TraceCheckUtils]: 57: Hoare triple {16121#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,122 INFO L290 TraceCheckUtils]: 58: Hoare triple {16121#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,122 INFO L290 TraceCheckUtils]: 59: Hoare triple {16121#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,122 INFO L290 TraceCheckUtils]: 60: Hoare triple {16121#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,122 INFO L290 TraceCheckUtils]: 61: Hoare triple {16121#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,122 INFO L290 TraceCheckUtils]: 62: Hoare triple {16121#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,123 INFO L290 TraceCheckUtils]: 63: Hoare triple {16121#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,123 INFO L290 TraceCheckUtils]: 64: Hoare triple {16121#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,123 INFO L290 TraceCheckUtils]: 65: Hoare triple {16121#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,123 INFO L290 TraceCheckUtils]: 66: Hoare triple {16121#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,123 INFO L290 TraceCheckUtils]: 67: Hoare triple {16121#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,123 INFO L290 TraceCheckUtils]: 68: Hoare triple {16121#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,123 INFO L290 TraceCheckUtils]: 69: Hoare triple {16121#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,123 INFO L290 TraceCheckUtils]: 70: Hoare triple {16121#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,123 INFO L290 TraceCheckUtils]: 71: Hoare triple {16121#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,123 INFO L290 TraceCheckUtils]: 72: Hoare triple {16121#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,123 INFO L290 TraceCheckUtils]: 73: Hoare triple {16121#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,123 INFO L290 TraceCheckUtils]: 74: Hoare triple {16121#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,124 INFO L290 TraceCheckUtils]: 75: Hoare triple {16121#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {16121#false} is VALID [2022-04-27 15:41:29,124 INFO L290 TraceCheckUtils]: 76: Hoare triple {16121#false} assume 8641 == #t~mem76;havoc #t~mem76; {16121#false} is VALID [2022-04-27 15:41:29,124 INFO L290 TraceCheckUtils]: 77: Hoare triple {16121#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16121#false} is VALID [2022-04-27 15:41:29,124 INFO L290 TraceCheckUtils]: 78: Hoare triple {16121#false} assume !(9 == ~blastFlag~0); {16121#false} is VALID [2022-04-27 15:41:29,124 INFO L290 TraceCheckUtils]: 79: Hoare triple {16121#false} assume !(12 == ~blastFlag~0); {16121#false} is VALID [2022-04-27 15:41:29,124 INFO L290 TraceCheckUtils]: 80: Hoare triple {16121#false} assume !false; {16121#false} is VALID [2022-04-27 15:41:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:41:29,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:41:29,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464209014] [2022-04-27 15:41:29,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464209014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:41:29,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:41:29,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:41:29,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095265725] [2022-04-27 15:41:29,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:41:29,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-27 15:41:29,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:41:29,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:29,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:29,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:41:29,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:41:29,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:41:29,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:41:29,191 INFO L87 Difference]: Start difference. First operand 238 states and 362 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:35,863 INFO L93 Difference]: Finished difference Result 479 states and 734 transitions. [2022-04-27 15:41:35,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:41:35,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-27 15:41:35,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:41:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:35,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-27 15:41:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-27 15:41:35,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-27 15:41:36,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:36,194 INFO L225 Difference]: With dead ends: 479 [2022-04-27 15:41:36,194 INFO L226 Difference]: Without dead ends: 267 [2022-04-27 15:41:36,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:41:36,195 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 19 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:41:36,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 598 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 15:41:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-27 15:41:36,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 254. [2022-04-27 15:41:36,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:41:36,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 254 states, 249 states have (on average 1.5301204819277108) internal successors, (381), 249 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:36,217 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 254 states, 249 states have (on average 1.5301204819277108) internal successors, (381), 249 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:36,217 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 254 states, 249 states have (on average 1.5301204819277108) internal successors, (381), 249 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:36,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:36,233 INFO L93 Difference]: Finished difference Result 267 states and 401 transitions. [2022-04-27 15:41:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 401 transitions. [2022-04-27 15:41:36,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:36,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:36,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 249 states have (on average 1.5301204819277108) internal successors, (381), 249 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-27 15:41:36,235 INFO L87 Difference]: Start difference. First operand has 254 states, 249 states have (on average 1.5301204819277108) internal successors, (381), 249 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-27 15:41:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:36,240 INFO L93 Difference]: Finished difference Result 267 states and 401 transitions. [2022-04-27 15:41:36,240 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 401 transitions. [2022-04-27 15:41:36,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:36,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:36,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:41:36,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:41:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 249 states have (on average 1.5301204819277108) internal successors, (381), 249 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 385 transitions. [2022-04-27 15:41:36,262 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 385 transitions. Word has length 81 [2022-04-27 15:41:36,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:41:36,262 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 385 transitions. [2022-04-27 15:41:36,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 385 transitions. [2022-04-27 15:41:36,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 15:41:36,264 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:41:36,264 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:41:36,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:41:36,264 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:41:36,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:41:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1171749751, now seen corresponding path program 1 times [2022-04-27 15:41:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:41:36,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818592682] [2022-04-27 15:41:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:41:36,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:41:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:36,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:41:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:36,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {17515#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {17507#true} is VALID [2022-04-27 15:41:36,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {17507#true} assume true; {17507#true} is VALID [2022-04-27 15:41:36,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17507#true} {17507#true} #720#return; {17507#true} is VALID [2022-04-27 15:41:36,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {17507#true} call ULTIMATE.init(); {17515#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:41:36,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {17515#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {17507#true} is VALID [2022-04-27 15:41:36,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {17507#true} assume true; {17507#true} is VALID [2022-04-27 15:41:36,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17507#true} {17507#true} #720#return; {17507#true} is VALID [2022-04-27 15:41:36,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {17507#true} call #t~ret161 := main(); {17507#true} is VALID [2022-04-27 15:41:36,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {17507#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {17507#true} is VALID [2022-04-27 15:41:36,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {17507#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {17507#true} is VALID [2022-04-27 15:41:36,432 INFO L272 TraceCheckUtils]: 7: Hoare triple {17507#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {17507#true} is VALID [2022-04-27 15:41:36,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {17507#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {17507#true} is VALID [2022-04-27 15:41:36,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {17507#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {17507#true} is VALID [2022-04-27 15:41:36,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {17507#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {17507#true} is VALID [2022-04-27 15:41:36,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {17507#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17507#true} is VALID [2022-04-27 15:41:36,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {17507#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {17507#true} is VALID [2022-04-27 15:41:36,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {17507#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {17507#true} is VALID [2022-04-27 15:41:36,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {17507#true} assume !false; {17507#true} is VALID [2022-04-27 15:41:36,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {17507#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {17507#true} is VALID [2022-04-27 15:41:36,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {17507#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {17507#true} is VALID [2022-04-27 15:41:36,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {17507#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17507#true} is VALID [2022-04-27 15:41:36,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {17507#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17507#true} is VALID [2022-04-27 15:41:36,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {17507#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17507#true} is VALID [2022-04-27 15:41:36,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {17507#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17507#true} is VALID [2022-04-27 15:41:36,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {17507#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17507#true} is VALID [2022-04-27 15:41:36,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {17507#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17507#true} is VALID [2022-04-27 15:41:36,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {17507#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17507#true} is VALID [2022-04-27 15:41:36,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {17507#true} assume 8464 == #t~mem55;havoc #t~mem55; {17507#true} is VALID [2022-04-27 15:41:36,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {17507#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {17507#true} is VALID [2022-04-27 15:41:36,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {17507#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17507#true} is VALID [2022-04-27 15:41:36,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {17507#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {17507#true} is VALID [2022-04-27 15:41:36,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {17507#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {17507#true} is VALID [2022-04-27 15:41:36,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {17507#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {17507#true} is VALID [2022-04-27 15:41:36,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {17507#true} ~skip~0 := 0; {17507#true} is VALID [2022-04-27 15:41:36,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {17507#true} assume !false; {17507#true} is VALID [2022-04-27 15:41:36,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {17507#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {17512#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:36,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {17512#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {17513#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:36,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {17513#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {17513#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:36,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {17513#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {17513#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:36,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {17513#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {17513#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:36,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {17513#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {17513#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:36,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {17513#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {17513#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:36,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {17513#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {17513#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:36,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {17513#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {17514#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-27 15:41:36,440 INFO L290 TraceCheckUtils]: 41: Hoare triple {17514#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {17508#false} is VALID [2022-04-27 15:41:36,440 INFO L290 TraceCheckUtils]: 42: Hoare triple {17508#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {17508#false} is VALID [2022-04-27 15:41:36,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {17508#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {17508#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {17508#false} is VALID [2022-04-27 15:41:36,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {17508#false} ~skip~0 := 0; {17508#false} is VALID [2022-04-27 15:41:36,441 INFO L290 TraceCheckUtils]: 46: Hoare triple {17508#false} assume !false; {17508#false} is VALID [2022-04-27 15:41:36,441 INFO L290 TraceCheckUtils]: 47: Hoare triple {17508#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {17508#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {17508#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,441 INFO L290 TraceCheckUtils]: 50: Hoare triple {17508#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,441 INFO L290 TraceCheckUtils]: 51: Hoare triple {17508#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {17508#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {17508#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,441 INFO L290 TraceCheckUtils]: 54: Hoare triple {17508#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,441 INFO L290 TraceCheckUtils]: 55: Hoare triple {17508#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,441 INFO L290 TraceCheckUtils]: 56: Hoare triple {17508#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,442 INFO L290 TraceCheckUtils]: 57: Hoare triple {17508#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,442 INFO L290 TraceCheckUtils]: 58: Hoare triple {17508#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,442 INFO L290 TraceCheckUtils]: 59: Hoare triple {17508#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,442 INFO L290 TraceCheckUtils]: 60: Hoare triple {17508#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,442 INFO L290 TraceCheckUtils]: 61: Hoare triple {17508#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,442 INFO L290 TraceCheckUtils]: 62: Hoare triple {17508#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,442 INFO L290 TraceCheckUtils]: 63: Hoare triple {17508#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,442 INFO L290 TraceCheckUtils]: 64: Hoare triple {17508#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,442 INFO L290 TraceCheckUtils]: 65: Hoare triple {17508#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,442 INFO L290 TraceCheckUtils]: 66: Hoare triple {17508#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,442 INFO L290 TraceCheckUtils]: 67: Hoare triple {17508#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,442 INFO L290 TraceCheckUtils]: 68: Hoare triple {17508#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,443 INFO L290 TraceCheckUtils]: 69: Hoare triple {17508#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,443 INFO L290 TraceCheckUtils]: 70: Hoare triple {17508#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,443 INFO L290 TraceCheckUtils]: 71: Hoare triple {17508#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,443 INFO L290 TraceCheckUtils]: 72: Hoare triple {17508#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,443 INFO L290 TraceCheckUtils]: 73: Hoare triple {17508#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,443 INFO L290 TraceCheckUtils]: 74: Hoare triple {17508#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,443 INFO L290 TraceCheckUtils]: 75: Hoare triple {17508#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,443 INFO L290 TraceCheckUtils]: 76: Hoare triple {17508#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {17508#false} is VALID [2022-04-27 15:41:36,443 INFO L290 TraceCheckUtils]: 77: Hoare triple {17508#false} assume 8641 == #t~mem76;havoc #t~mem76; {17508#false} is VALID [2022-04-27 15:41:36,443 INFO L290 TraceCheckUtils]: 78: Hoare triple {17508#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {17508#false} is VALID [2022-04-27 15:41:36,443 INFO L290 TraceCheckUtils]: 79: Hoare triple {17508#false} assume !(9 == ~blastFlag~0); {17508#false} is VALID [2022-04-27 15:41:36,444 INFO L290 TraceCheckUtils]: 80: Hoare triple {17508#false} assume !(12 == ~blastFlag~0); {17508#false} is VALID [2022-04-27 15:41:36,444 INFO L290 TraceCheckUtils]: 81: Hoare triple {17508#false} assume !false; {17508#false} is VALID [2022-04-27 15:41:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 15:41:36,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:41:36,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818592682] [2022-04-27 15:41:36,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818592682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:41:36,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:41:36,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 15:41:36,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685199160] [2022-04-27 15:41:36,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:41:36,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-27 15:41:36,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:41:36,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:36,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:36,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 15:41:36,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:41:36,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 15:41:36,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:41:36,507 INFO L87 Difference]: Start difference. First operand 254 states and 385 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:42,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:42,800 INFO L93 Difference]: Finished difference Result 491 states and 752 transitions. [2022-04-27 15:41:42,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 15:41:42,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-27 15:41:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:41:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 443 transitions. [2022-04-27 15:41:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 443 transitions. [2022-04-27 15:41:42,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 443 transitions. [2022-04-27 15:41:43,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:43,093 INFO L225 Difference]: With dead ends: 491 [2022-04-27 15:41:43,093 INFO L226 Difference]: Without dead ends: 263 [2022-04-27 15:41:43,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:41:43,094 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 3 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:41:43,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 673 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-27 15:41:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-27 15:41:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-04-27 15:41:43,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:41:43,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 263 states, 258 states have (on average 1.5193798449612403) internal successors, (392), 258 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:43,100 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 263 states, 258 states have (on average 1.5193798449612403) internal successors, (392), 258 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:43,100 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 263 states, 258 states have (on average 1.5193798449612403) internal successors, (392), 258 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:43,105 INFO L93 Difference]: Finished difference Result 263 states and 396 transitions. [2022-04-27 15:41:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 396 transitions. [2022-04-27 15:41:43,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:43,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:43,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.5193798449612403) internal successors, (392), 258 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-27 15:41:43,106 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.5193798449612403) internal successors, (392), 258 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-27 15:41:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:43,111 INFO L93 Difference]: Finished difference Result 263 states and 396 transitions. [2022-04-27 15:41:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 396 transitions. [2022-04-27 15:41:43,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:43,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:43,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:41:43,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:41:43,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.5193798449612403) internal successors, (392), 258 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 396 transitions. [2022-04-27 15:41:43,117 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 396 transitions. Word has length 82 [2022-04-27 15:41:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:41:43,117 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 396 transitions. [2022-04-27 15:41:43,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 396 transitions. [2022-04-27 15:41:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:41:43,118 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:41:43,118 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:41:43,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:41:43,119 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:41:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:41:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1031424542, now seen corresponding path program 1 times [2022-04-27 15:41:43,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:41:43,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869052026] [2022-04-27 15:41:43,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:41:43,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:41:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:41:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:43,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {18916#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18909#true} is VALID [2022-04-27 15:41:43,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {18909#true} assume true; {18909#true} is VALID [2022-04-27 15:41:43,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18909#true} {18909#true} #720#return; {18909#true} is VALID [2022-04-27 15:41:43,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {18909#true} call ULTIMATE.init(); {18916#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:41:43,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {18916#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18909#true} is VALID [2022-04-27 15:41:43,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {18909#true} assume true; {18909#true} is VALID [2022-04-27 15:41:43,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18909#true} {18909#true} #720#return; {18909#true} is VALID [2022-04-27 15:41:43,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {18909#true} call #t~ret161 := main(); {18909#true} is VALID [2022-04-27 15:41:43,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {18909#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18909#true} is VALID [2022-04-27 15:41:43,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {18909#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {18909#true} is VALID [2022-04-27 15:41:43,256 INFO L272 TraceCheckUtils]: 7: Hoare triple {18909#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18909#true} is VALID [2022-04-27 15:41:43,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {18909#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18909#true} is VALID [2022-04-27 15:41:43,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {18909#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {18909#true} is VALID [2022-04-27 15:41:43,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {18909#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {18909#true} is VALID [2022-04-27 15:41:43,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {18909#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18909#true} is VALID [2022-04-27 15:41:43,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {18909#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {18909#true} is VALID [2022-04-27 15:41:43,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {18909#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {18909#true} is VALID [2022-04-27 15:41:43,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {18909#true} assume !false; {18909#true} is VALID [2022-04-27 15:41:43,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {18909#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18909#true} is VALID [2022-04-27 15:41:43,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {18909#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18909#true} is VALID [2022-04-27 15:41:43,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {18909#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18909#true} is VALID [2022-04-27 15:41:43,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {18909#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18909#true} is VALID [2022-04-27 15:41:43,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {18909#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18909#true} is VALID [2022-04-27 15:41:43,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {18909#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18909#true} is VALID [2022-04-27 15:41:43,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {18909#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18909#true} is VALID [2022-04-27 15:41:43,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {18909#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18909#true} is VALID [2022-04-27 15:41:43,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {18909#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18909#true} is VALID [2022-04-27 15:41:43,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {18909#true} assume 8464 == #t~mem55;havoc #t~mem55; {18909#true} is VALID [2022-04-27 15:41:43,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {18909#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {18909#true} is VALID [2022-04-27 15:41:43,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {18909#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18909#true} is VALID [2022-04-27 15:41:43,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {18909#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:43,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:43,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:43,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:43,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:43,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:43,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:43,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:43,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {18914#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18915#(= |ssl3_accept_#t~mem50| 8496)} is VALID [2022-04-27 15:41:43,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {18915#(= |ssl3_accept_#t~mem50| 8496)} assume 24576 == #t~mem50;havoc #t~mem50; {18910#false} is VALID [2022-04-27 15:41:43,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {18910#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,263 INFO L290 TraceCheckUtils]: 38: Hoare triple {18910#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18910#false} is VALID [2022-04-27 15:41:43,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {18910#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,263 INFO L290 TraceCheckUtils]: 40: Hoare triple {18910#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,263 INFO L290 TraceCheckUtils]: 41: Hoare triple {18910#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {18910#false} is VALID [2022-04-27 15:41:43,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {18910#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {18910#false} assume 12292 != #t~mem85;havoc #t~mem85; {18910#false} is VALID [2022-04-27 15:41:43,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {18910#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {18910#false} is VALID [2022-04-27 15:41:43,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {18910#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,264 INFO L290 TraceCheckUtils]: 46: Hoare triple {18910#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18910#false} is VALID [2022-04-27 15:41:43,264 INFO L290 TraceCheckUtils]: 47: Hoare triple {18910#false} ~skip~0 := 0; {18910#false} is VALID [2022-04-27 15:41:43,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {18910#false} assume !false; {18910#false} is VALID [2022-04-27 15:41:43,264 INFO L290 TraceCheckUtils]: 49: Hoare triple {18910#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,264 INFO L290 TraceCheckUtils]: 50: Hoare triple {18910#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,264 INFO L290 TraceCheckUtils]: 51: Hoare triple {18910#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {18910#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {18910#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,264 INFO L290 TraceCheckUtils]: 54: Hoare triple {18910#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,264 INFO L290 TraceCheckUtils]: 55: Hoare triple {18910#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,264 INFO L290 TraceCheckUtils]: 56: Hoare triple {18910#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {18910#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {18910#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,265 INFO L290 TraceCheckUtils]: 59: Hoare triple {18910#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,265 INFO L290 TraceCheckUtils]: 60: Hoare triple {18910#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {18910#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {18910#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {18910#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,265 INFO L290 TraceCheckUtils]: 64: Hoare triple {18910#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,265 INFO L290 TraceCheckUtils]: 65: Hoare triple {18910#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,265 INFO L290 TraceCheckUtils]: 66: Hoare triple {18910#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,265 INFO L290 TraceCheckUtils]: 67: Hoare triple {18910#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,266 INFO L290 TraceCheckUtils]: 68: Hoare triple {18910#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,266 INFO L290 TraceCheckUtils]: 69: Hoare triple {18910#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,266 INFO L290 TraceCheckUtils]: 70: Hoare triple {18910#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,266 INFO L290 TraceCheckUtils]: 71: Hoare triple {18910#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,266 INFO L290 TraceCheckUtils]: 72: Hoare triple {18910#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,266 INFO L290 TraceCheckUtils]: 73: Hoare triple {18910#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,266 INFO L290 TraceCheckUtils]: 74: Hoare triple {18910#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,266 INFO L290 TraceCheckUtils]: 75: Hoare triple {18910#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,266 INFO L290 TraceCheckUtils]: 76: Hoare triple {18910#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,266 INFO L290 TraceCheckUtils]: 77: Hoare triple {18910#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,266 INFO L290 TraceCheckUtils]: 78: Hoare triple {18910#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {18910#false} is VALID [2022-04-27 15:41:43,266 INFO L290 TraceCheckUtils]: 79: Hoare triple {18910#false} assume 8641 == #t~mem76;havoc #t~mem76; {18910#false} is VALID [2022-04-27 15:41:43,267 INFO L290 TraceCheckUtils]: 80: Hoare triple {18910#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18910#false} is VALID [2022-04-27 15:41:43,267 INFO L290 TraceCheckUtils]: 81: Hoare triple {18910#false} assume !(9 == ~blastFlag~0); {18910#false} is VALID [2022-04-27 15:41:43,267 INFO L290 TraceCheckUtils]: 82: Hoare triple {18910#false} assume !(12 == ~blastFlag~0); {18910#false} is VALID [2022-04-27 15:41:43,267 INFO L290 TraceCheckUtils]: 83: Hoare triple {18910#false} assume !false; {18910#false} is VALID [2022-04-27 15:41:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:41:43,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:41:43,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869052026] [2022-04-27 15:41:43,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869052026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:41:43,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:41:43,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:41:43,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137568144] [2022-04-27 15:41:43,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:41:43,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 15:41:43,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:41:43,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:43,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:43,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:41:43,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:41:43,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:41:43,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:41:43,337 INFO L87 Difference]: Start difference. First operand 263 states and 396 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:48,792 INFO L93 Difference]: Finished difference Result 517 states and 784 transitions. [2022-04-27 15:41:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:41:48,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-27 15:41:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:41:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2022-04-27 15:41:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2022-04-27 15:41:48,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 485 transitions. [2022-04-27 15:41:49,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:49,133 INFO L225 Difference]: With dead ends: 517 [2022-04-27 15:41:49,133 INFO L226 Difference]: Without dead ends: 280 [2022-04-27 15:41:49,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:41:49,134 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 34 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:41:49,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 541 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 15:41:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-27 15:41:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2022-04-27 15:41:49,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:41:49,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.5155038759689923) internal successors, (391), 258 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:49,141 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.5155038759689923) internal successors, (391), 258 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:49,142 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.5155038759689923) internal successors, (391), 258 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:49,147 INFO L93 Difference]: Finished difference Result 280 states and 417 transitions. [2022-04-27 15:41:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 417 transitions. [2022-04-27 15:41:49,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:49,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:49,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.5155038759689923) internal successors, (391), 258 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-27 15:41:49,148 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.5155038759689923) internal successors, (391), 258 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-27 15:41:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:49,153 INFO L93 Difference]: Finished difference Result 280 states and 417 transitions. [2022-04-27 15:41:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 417 transitions. [2022-04-27 15:41:49,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:49,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:49,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:41:49,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:41:49,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.5155038759689923) internal successors, (391), 258 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:49,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 395 transitions. [2022-04-27 15:41:49,159 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 395 transitions. Word has length 84 [2022-04-27 15:41:49,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:41:49,159 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 395 transitions. [2022-04-27 15:41:49,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:49,160 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 395 transitions. [2022-04-27 15:41:49,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-27 15:41:49,161 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:41:49,161 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:41:49,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:41:49,161 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:41:49,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:41:49,162 INFO L85 PathProgramCache]: Analyzing trace with hash 618950673, now seen corresponding path program 1 times [2022-04-27 15:41:49,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:41:49,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702536555] [2022-04-27 15:41:49,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:41:49,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:41:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:49,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:41:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:49,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {20382#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20375#true} is VALID [2022-04-27 15:41:49,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {20375#true} assume true; {20375#true} is VALID [2022-04-27 15:41:49,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20375#true} {20375#true} #720#return; {20375#true} is VALID [2022-04-27 15:41:49,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {20375#true} call ULTIMATE.init(); {20382#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:41:49,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {20382#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20375#true} is VALID [2022-04-27 15:41:49,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {20375#true} assume true; {20375#true} is VALID [2022-04-27 15:41:49,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20375#true} {20375#true} #720#return; {20375#true} is VALID [2022-04-27 15:41:49,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {20375#true} call #t~ret161 := main(); {20375#true} is VALID [2022-04-27 15:41:49,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {20375#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {20375#true} is VALID [2022-04-27 15:41:49,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {20375#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,305 INFO L272 TraceCheckUtils]: 7: Hoare triple {20375#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20375#true} is VALID [2022-04-27 15:41:49,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {20375#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {20375#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {20375#true} is VALID [2022-04-27 15:41:49,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {20375#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {20375#true} is VALID [2022-04-27 15:41:49,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {20375#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20375#true} is VALID [2022-04-27 15:41:49,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {20375#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {20375#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {20375#true} is VALID [2022-04-27 15:41:49,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {20375#true} assume !false; {20375#true} is VALID [2022-04-27 15:41:49,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {20375#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {20375#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {20375#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {20375#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {20375#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {20375#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {20375#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {20375#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {20375#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {20375#true} assume 8464 == #t~mem55;havoc #t~mem55; {20375#true} is VALID [2022-04-27 15:41:49,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {20375#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {20375#true} is VALID [2022-04-27 15:41:49,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {20375#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20375#true} is VALID [2022-04-27 15:41:49,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {20375#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {20375#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {20375#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20375#true} is VALID [2022-04-27 15:41:49,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {20375#true} ~skip~0 := 0; {20375#true} is VALID [2022-04-27 15:41:49,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {20375#true} assume !false; {20375#true} is VALID [2022-04-27 15:41:49,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {20375#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {20375#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {20375#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {20375#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {20375#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {20375#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {20375#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {20375#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {20375#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {20375#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {20375#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {20375#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {20375#true} assume 8496 == #t~mem58;havoc #t~mem58; {20375#true} is VALID [2022-04-27 15:41:49,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {20375#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {20375#true} is VALID [2022-04-27 15:41:49,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {20375#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {20375#true} is VALID [2022-04-27 15:41:49,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {20375#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {20375#true} is VALID [2022-04-27 15:41:49,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {20375#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,311 INFO L290 TraceCheckUtils]: 50: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,312 INFO L290 TraceCheckUtils]: 51: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,312 INFO L290 TraceCheckUtils]: 52: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,312 INFO L290 TraceCheckUtils]: 53: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,313 INFO L290 TraceCheckUtils]: 54: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,313 INFO L290 TraceCheckUtils]: 55: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,314 INFO L290 TraceCheckUtils]: 56: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,314 INFO L290 TraceCheckUtils]: 57: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,315 INFO L290 TraceCheckUtils]: 58: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,315 INFO L290 TraceCheckUtils]: 59: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,315 INFO L290 TraceCheckUtils]: 60: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,316 INFO L290 TraceCheckUtils]: 61: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,316 INFO L290 TraceCheckUtils]: 62: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,317 INFO L290 TraceCheckUtils]: 63: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,317 INFO L290 TraceCheckUtils]: 64: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,318 INFO L290 TraceCheckUtils]: 65: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,318 INFO L290 TraceCheckUtils]: 66: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,318 INFO L290 TraceCheckUtils]: 67: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,319 INFO L290 TraceCheckUtils]: 69: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,320 INFO L290 TraceCheckUtils]: 70: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,320 INFO L290 TraceCheckUtils]: 71: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,321 INFO L290 TraceCheckUtils]: 72: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,321 INFO L290 TraceCheckUtils]: 73: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,321 INFO L290 TraceCheckUtils]: 74: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,322 INFO L290 TraceCheckUtils]: 75: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,322 INFO L290 TraceCheckUtils]: 76: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,323 INFO L290 TraceCheckUtils]: 77: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,323 INFO L290 TraceCheckUtils]: 78: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,323 INFO L290 TraceCheckUtils]: 79: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,324 INFO L290 TraceCheckUtils]: 80: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,324 INFO L290 TraceCheckUtils]: 81: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,325 INFO L290 TraceCheckUtils]: 82: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:41:49,325 INFO L290 TraceCheckUtils]: 83: Hoare triple {20380#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {20381#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-27 15:41:49,325 INFO L290 TraceCheckUtils]: 84: Hoare triple {20381#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {20376#false} is VALID [2022-04-27 15:41:49,326 INFO L290 TraceCheckUtils]: 85: Hoare triple {20376#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {20376#false} is VALID [2022-04-27 15:41:49,326 INFO L290 TraceCheckUtils]: 86: Hoare triple {20376#false} assume !(9 == ~blastFlag~0); {20376#false} is VALID [2022-04-27 15:41:49,326 INFO L290 TraceCheckUtils]: 87: Hoare triple {20376#false} assume !(12 == ~blastFlag~0); {20376#false} is VALID [2022-04-27 15:41:49,326 INFO L290 TraceCheckUtils]: 88: Hoare triple {20376#false} assume !false; {20376#false} is VALID [2022-04-27 15:41:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:41:49,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:41:49,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702536555] [2022-04-27 15:41:49,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702536555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:41:49,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:41:49,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:41:49,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145602201] [2022-04-27 15:41:49,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:41:49,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-27 15:41:49,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:41:49,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:49,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:49,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:41:49,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:41:49,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:41:49,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:41:49,405 INFO L87 Difference]: Start difference. First operand 263 states and 395 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:51,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:41:57,477 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:41:58,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:58,631 INFO L93 Difference]: Finished difference Result 613 states and 933 transitions. [2022-04-27 15:41:58,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:41:58,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-27 15:41:58,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:41:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2022-04-27 15:41:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2022-04-27 15:41:58,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 619 transitions. [2022-04-27 15:41:59,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 619 edges. 619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:59,071 INFO L225 Difference]: With dead ends: 613 [2022-04-27 15:41:59,071 INFO L226 Difference]: Without dead ends: 376 [2022-04-27 15:41:59,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:41:59,072 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 127 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:41:59,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 394 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-27 15:41:59,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-04-27 15:41:59,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 285. [2022-04-27 15:41:59,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:41:59,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 376 states. Second operand has 285 states, 280 states have (on average 1.55) internal successors, (434), 280 states have internal predecessors, (434), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:59,079 INFO L74 IsIncluded]: Start isIncluded. First operand 376 states. Second operand has 285 states, 280 states have (on average 1.55) internal successors, (434), 280 states have internal predecessors, (434), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:59,079 INFO L87 Difference]: Start difference. First operand 376 states. Second operand has 285 states, 280 states have (on average 1.55) internal successors, (434), 280 states have internal predecessors, (434), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:59,087 INFO L93 Difference]: Finished difference Result 376 states and 567 transitions. [2022-04-27 15:41:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 567 transitions. [2022-04-27 15:41:59,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:59,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:59,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 280 states have (on average 1.55) internal successors, (434), 280 states have internal predecessors, (434), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 376 states. [2022-04-27 15:41:59,089 INFO L87 Difference]: Start difference. First operand has 285 states, 280 states have (on average 1.55) internal successors, (434), 280 states have internal predecessors, (434), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 376 states. [2022-04-27 15:41:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:41:59,096 INFO L93 Difference]: Finished difference Result 376 states and 567 transitions. [2022-04-27 15:41:59,096 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 567 transitions. [2022-04-27 15:41:59,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:41:59,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:41:59,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:41:59,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:41:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 280 states have (on average 1.55) internal successors, (434), 280 states have internal predecessors, (434), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 438 transitions. [2022-04-27 15:41:59,103 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 438 transitions. Word has length 89 [2022-04-27 15:41:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:41:59,103 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 438 transitions. [2022-04-27 15:41:59,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 438 transitions. [2022-04-27 15:41:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-27 15:41:59,105 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:41:59,105 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:41:59,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:41:59,105 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:41:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:41:59,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1158638899, now seen corresponding path program 1 times [2022-04-27 15:41:59,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:41:59,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305161991] [2022-04-27 15:41:59,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:41:59,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:41:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:59,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:41:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:41:59,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {22175#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22168#true} is VALID [2022-04-27 15:41:59,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {22168#true} assume true; {22168#true} is VALID [2022-04-27 15:41:59,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22168#true} {22168#true} #720#return; {22168#true} is VALID [2022-04-27 15:41:59,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {22168#true} call ULTIMATE.init(); {22175#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:41:59,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {22175#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22168#true} is VALID [2022-04-27 15:41:59,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {22168#true} assume true; {22168#true} is VALID [2022-04-27 15:41:59,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22168#true} {22168#true} #720#return; {22168#true} is VALID [2022-04-27 15:41:59,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {22168#true} call #t~ret161 := main(); {22168#true} is VALID [2022-04-27 15:41:59,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {22168#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {22168#true} is VALID [2022-04-27 15:41:59,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {22168#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,244 INFO L272 TraceCheckUtils]: 7: Hoare triple {22168#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22168#true} is VALID [2022-04-27 15:41:59,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {22168#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {22168#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {22168#true} is VALID [2022-04-27 15:41:59,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {22168#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {22168#true} is VALID [2022-04-27 15:41:59,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {22168#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {22168#true} is VALID [2022-04-27 15:41:59,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {22168#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {22168#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {22168#true} is VALID [2022-04-27 15:41:59,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {22168#true} assume !false; {22168#true} is VALID [2022-04-27 15:41:59,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {22168#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {22168#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {22168#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {22168#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {22168#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {22168#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {22168#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {22168#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {22168#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {22168#true} assume 8464 == #t~mem55;havoc #t~mem55; {22168#true} is VALID [2022-04-27 15:41:59,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {22168#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {22168#true} is VALID [2022-04-27 15:41:59,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {22168#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {22168#true} is VALID [2022-04-27 15:41:59,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {22168#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {22168#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {22168#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22168#true} is VALID [2022-04-27 15:41:59,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {22168#true} ~skip~0 := 0; {22168#true} is VALID [2022-04-27 15:41:59,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {22168#true} assume !false; {22168#true} is VALID [2022-04-27 15:41:59,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {22168#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {22168#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {22168#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {22168#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {22168#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {22168#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {22168#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,247 INFO L290 TraceCheckUtils]: 39: Hoare triple {22168#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {22168#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {22168#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,248 INFO L290 TraceCheckUtils]: 42: Hoare triple {22168#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,248 INFO L290 TraceCheckUtils]: 43: Hoare triple {22168#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {22168#true} assume 8496 == #t~mem58;havoc #t~mem58; {22168#true} is VALID [2022-04-27 15:41:59,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {22168#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {22168#true} is VALID [2022-04-27 15:41:59,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {22168#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {22168#true} is VALID [2022-04-27 15:41:59,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {22168#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {22168#true} is VALID [2022-04-27 15:41:59,249 INFO L290 TraceCheckUtils]: 48: Hoare triple {22168#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,250 INFO L290 TraceCheckUtils]: 49: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,251 INFO L290 TraceCheckUtils]: 51: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,252 INFO L290 TraceCheckUtils]: 55: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,253 INFO L290 TraceCheckUtils]: 57: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,253 INFO L290 TraceCheckUtils]: 58: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,254 INFO L290 TraceCheckUtils]: 59: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,254 INFO L290 TraceCheckUtils]: 60: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,256 INFO L290 TraceCheckUtils]: 64: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,256 INFO L290 TraceCheckUtils]: 65: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,256 INFO L290 TraceCheckUtils]: 66: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,257 INFO L290 TraceCheckUtils]: 67: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,257 INFO L290 TraceCheckUtils]: 68: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,258 INFO L290 TraceCheckUtils]: 69: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,262 INFO L290 TraceCheckUtils]: 70: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,262 INFO L290 TraceCheckUtils]: 71: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,263 INFO L290 TraceCheckUtils]: 72: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,263 INFO L290 TraceCheckUtils]: 73: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,264 INFO L290 TraceCheckUtils]: 74: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:41:59,264 INFO L290 TraceCheckUtils]: 75: Hoare triple {22173#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22174#(= |ssl3_accept_#t~mem68| 8656)} is VALID [2022-04-27 15:41:59,264 INFO L290 TraceCheckUtils]: 76: Hoare triple {22174#(= |ssl3_accept_#t~mem68| 8656)} assume 8448 == #t~mem68;havoc #t~mem68; {22169#false} is VALID [2022-04-27 15:41:59,265 INFO L290 TraceCheckUtils]: 77: Hoare triple {22169#false} assume !(~num1~0 > 0); {22169#false} is VALID [2022-04-27 15:41:59,265 INFO L290 TraceCheckUtils]: 78: Hoare triple {22169#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {22169#false} is VALID [2022-04-27 15:41:59,265 INFO L290 TraceCheckUtils]: 79: Hoare triple {22169#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,265 INFO L290 TraceCheckUtils]: 80: Hoare triple {22169#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22169#false} is VALID [2022-04-27 15:41:59,265 INFO L290 TraceCheckUtils]: 81: Hoare triple {22169#false} ~skip~0 := 0; {22169#false} is VALID [2022-04-27 15:41:59,265 INFO L290 TraceCheckUtils]: 82: Hoare triple {22169#false} assume !false; {22169#false} is VALID [2022-04-27 15:41:59,265 INFO L290 TraceCheckUtils]: 83: Hoare triple {22169#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,265 INFO L290 TraceCheckUtils]: 84: Hoare triple {22169#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,265 INFO L290 TraceCheckUtils]: 85: Hoare triple {22169#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,265 INFO L290 TraceCheckUtils]: 86: Hoare triple {22169#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,265 INFO L290 TraceCheckUtils]: 87: Hoare triple {22169#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,266 INFO L290 TraceCheckUtils]: 88: Hoare triple {22169#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,266 INFO L290 TraceCheckUtils]: 89: Hoare triple {22169#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,266 INFO L290 TraceCheckUtils]: 90: Hoare triple {22169#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,266 INFO L290 TraceCheckUtils]: 91: Hoare triple {22169#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,266 INFO L290 TraceCheckUtils]: 92: Hoare triple {22169#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,266 INFO L290 TraceCheckUtils]: 93: Hoare triple {22169#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,266 INFO L290 TraceCheckUtils]: 94: Hoare triple {22169#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,266 INFO L290 TraceCheckUtils]: 95: Hoare triple {22169#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,266 INFO L290 TraceCheckUtils]: 96: Hoare triple {22169#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,266 INFO L290 TraceCheckUtils]: 97: Hoare triple {22169#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,266 INFO L290 TraceCheckUtils]: 98: Hoare triple {22169#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,267 INFO L290 TraceCheckUtils]: 99: Hoare triple {22169#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,267 INFO L290 TraceCheckUtils]: 100: Hoare triple {22169#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,267 INFO L290 TraceCheckUtils]: 101: Hoare triple {22169#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,267 INFO L290 TraceCheckUtils]: 102: Hoare triple {22169#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,267 INFO L290 TraceCheckUtils]: 103: Hoare triple {22169#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,267 INFO L290 TraceCheckUtils]: 104: Hoare triple {22169#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,267 INFO L290 TraceCheckUtils]: 105: Hoare triple {22169#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,267 INFO L290 TraceCheckUtils]: 106: Hoare triple {22169#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,267 INFO L290 TraceCheckUtils]: 107: Hoare triple {22169#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,267 INFO L290 TraceCheckUtils]: 108: Hoare triple {22169#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,267 INFO L290 TraceCheckUtils]: 109: Hoare triple {22169#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,268 INFO L290 TraceCheckUtils]: 110: Hoare triple {22169#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,268 INFO L290 TraceCheckUtils]: 111: Hoare triple {22169#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {22169#false} is VALID [2022-04-27 15:41:59,268 INFO L290 TraceCheckUtils]: 112: Hoare triple {22169#false} assume 8640 == #t~mem75;havoc #t~mem75; {22169#false} is VALID [2022-04-27 15:41:59,268 INFO L290 TraceCheckUtils]: 113: Hoare triple {22169#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {22169#false} is VALID [2022-04-27 15:41:59,268 INFO L290 TraceCheckUtils]: 114: Hoare triple {22169#false} assume !(9 == ~blastFlag~0); {22169#false} is VALID [2022-04-27 15:41:59,268 INFO L290 TraceCheckUtils]: 115: Hoare triple {22169#false} assume !(12 == ~blastFlag~0); {22169#false} is VALID [2022-04-27 15:41:59,268 INFO L290 TraceCheckUtils]: 116: Hoare triple {22169#false} assume !false; {22169#false} is VALID [2022-04-27 15:41:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:41:59,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:41:59,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305161991] [2022-04-27 15:41:59,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305161991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:41:59,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:41:59,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:41:59,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104360598] [2022-04-27 15:41:59,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:41:59,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-27 15:41:59,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:41:59,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:41:59,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:41:59,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:41:59,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:41:59,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:41:59,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:41:59,345 INFO L87 Difference]: Start difference. First operand 285 states and 438 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:04,888 INFO L93 Difference]: Finished difference Result 653 states and 1009 transitions. [2022-04-27 15:42:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:42:04,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-27 15:42:04,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:42:04,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-27 15:42:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-27 15:42:04,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 583 transitions. [2022-04-27 15:42:05,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:05,276 INFO L225 Difference]: With dead ends: 653 [2022-04-27 15:42:05,276 INFO L226 Difference]: Without dead ends: 394 [2022-04-27 15:42:05,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:42:05,277 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 95 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:42:05,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 537 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:42:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-04-27 15:42:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 319. [2022-04-27 15:42:05,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:42:05,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 319 states, 314 states have (on average 1.5573248407643312) internal successors, (489), 314 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:05,284 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 319 states, 314 states have (on average 1.5573248407643312) internal successors, (489), 314 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:05,285 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 319 states, 314 states have (on average 1.5573248407643312) internal successors, (489), 314 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:05,293 INFO L93 Difference]: Finished difference Result 394 states and 600 transitions. [2022-04-27 15:42:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 600 transitions. [2022-04-27 15:42:05,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:05,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:05,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 319 states, 314 states have (on average 1.5573248407643312) internal successors, (489), 314 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 394 states. [2022-04-27 15:42:05,295 INFO L87 Difference]: Start difference. First operand has 319 states, 314 states have (on average 1.5573248407643312) internal successors, (489), 314 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 394 states. [2022-04-27 15:42:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:05,304 INFO L93 Difference]: Finished difference Result 394 states and 600 transitions. [2022-04-27 15:42:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 600 transitions. [2022-04-27 15:42:05,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:05,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:05,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:42:05,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:42:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 314 states have (on average 1.5573248407643312) internal successors, (489), 314 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 493 transitions. [2022-04-27 15:42:05,311 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 493 transitions. Word has length 117 [2022-04-27 15:42:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:42:05,311 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 493 transitions. [2022-04-27 15:42:05,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 493 transitions. [2022-04-27 15:42:05,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-27 15:42:05,313 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:42:05,313 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:42:05,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:42:05,313 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:42:05,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:42:05,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1651265073, now seen corresponding path program 1 times [2022-04-27 15:42:05,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:42:05,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298782577] [2022-04-27 15:42:05,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:42:05,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:42:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:05,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:42:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:05,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {24078#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24071#true} is VALID [2022-04-27 15:42:05,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {24071#true} assume true; {24071#true} is VALID [2022-04-27 15:42:05,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24071#true} {24071#true} #720#return; {24071#true} is VALID [2022-04-27 15:42:05,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {24071#true} call ULTIMATE.init(); {24078#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:42:05,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {24078#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24071#true} is VALID [2022-04-27 15:42:05,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {24071#true} assume true; {24071#true} is VALID [2022-04-27 15:42:05,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24071#true} {24071#true} #720#return; {24071#true} is VALID [2022-04-27 15:42:05,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {24071#true} call #t~ret161 := main(); {24071#true} is VALID [2022-04-27 15:42:05,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {24071#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {24071#true} is VALID [2022-04-27 15:42:05,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {24071#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,466 INFO L272 TraceCheckUtils]: 7: Hoare triple {24071#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {24071#true} is VALID [2022-04-27 15:42:05,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {24071#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {24071#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {24071#true} is VALID [2022-04-27 15:42:05,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {24071#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {24071#true} is VALID [2022-04-27 15:42:05,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {24071#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24071#true} is VALID [2022-04-27 15:42:05,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {24071#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {24071#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {24071#true} is VALID [2022-04-27 15:42:05,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {24071#true} assume !false; {24071#true} is VALID [2022-04-27 15:42:05,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {24071#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {24071#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {24071#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {24071#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {24071#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {24071#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {24071#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {24071#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {24071#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {24071#true} assume 8464 == #t~mem55;havoc #t~mem55; {24071#true} is VALID [2022-04-27 15:42:05,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {24071#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {24071#true} is VALID [2022-04-27 15:42:05,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {24071#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24071#true} is VALID [2022-04-27 15:42:05,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {24071#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {24071#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {24071#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24071#true} is VALID [2022-04-27 15:42:05,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {24071#true} ~skip~0 := 0; {24071#true} is VALID [2022-04-27 15:42:05,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {24071#true} assume !false; {24071#true} is VALID [2022-04-27 15:42:05,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {24071#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {24071#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {24071#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {24071#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {24071#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {24071#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {24071#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {24071#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {24071#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,469 INFO L290 TraceCheckUtils]: 41: Hoare triple {24071#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,469 INFO L290 TraceCheckUtils]: 42: Hoare triple {24071#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,469 INFO L290 TraceCheckUtils]: 43: Hoare triple {24071#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,469 INFO L290 TraceCheckUtils]: 44: Hoare triple {24071#true} assume 8496 == #t~mem58;havoc #t~mem58; {24071#true} is VALID [2022-04-27 15:42:05,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {24071#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {24071#true} is VALID [2022-04-27 15:42:05,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {24071#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {24071#true} is VALID [2022-04-27 15:42:05,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {24071#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {24071#true} is VALID [2022-04-27 15:42:05,470 INFO L290 TraceCheckUtils]: 48: Hoare triple {24071#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,471 INFO L290 TraceCheckUtils]: 49: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,471 INFO L290 TraceCheckUtils]: 50: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,472 INFO L290 TraceCheckUtils]: 51: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,472 INFO L290 TraceCheckUtils]: 52: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,472 INFO L290 TraceCheckUtils]: 53: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,473 INFO L290 TraceCheckUtils]: 54: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,473 INFO L290 TraceCheckUtils]: 55: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,474 INFO L290 TraceCheckUtils]: 56: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,474 INFO L290 TraceCheckUtils]: 57: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,474 INFO L290 TraceCheckUtils]: 58: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,475 INFO L290 TraceCheckUtils]: 59: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,475 INFO L290 TraceCheckUtils]: 60: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,476 INFO L290 TraceCheckUtils]: 61: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,476 INFO L290 TraceCheckUtils]: 62: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,476 INFO L290 TraceCheckUtils]: 63: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,477 INFO L290 TraceCheckUtils]: 64: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,477 INFO L290 TraceCheckUtils]: 65: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,478 INFO L290 TraceCheckUtils]: 66: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:42:05,478 INFO L290 TraceCheckUtils]: 67: Hoare triple {24076#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24077#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-27 15:42:05,478 INFO L290 TraceCheckUtils]: 68: Hoare triple {24077#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,478 INFO L290 TraceCheckUtils]: 69: Hoare triple {24072#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,478 INFO L290 TraceCheckUtils]: 70: Hoare triple {24072#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,478 INFO L290 TraceCheckUtils]: 71: Hoare triple {24072#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,479 INFO L290 TraceCheckUtils]: 72: Hoare triple {24072#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,479 INFO L290 TraceCheckUtils]: 73: Hoare triple {24072#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,479 INFO L290 TraceCheckUtils]: 74: Hoare triple {24072#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,479 INFO L290 TraceCheckUtils]: 75: Hoare triple {24072#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,479 INFO L290 TraceCheckUtils]: 76: Hoare triple {24072#false} assume 8448 == #t~mem68;havoc #t~mem68; {24072#false} is VALID [2022-04-27 15:42:05,479 INFO L290 TraceCheckUtils]: 77: Hoare triple {24072#false} assume !(~num1~0 > 0); {24072#false} is VALID [2022-04-27 15:42:05,479 INFO L290 TraceCheckUtils]: 78: Hoare triple {24072#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {24072#false} is VALID [2022-04-27 15:42:05,479 INFO L290 TraceCheckUtils]: 79: Hoare triple {24072#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,479 INFO L290 TraceCheckUtils]: 80: Hoare triple {24072#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24072#false} is VALID [2022-04-27 15:42:05,479 INFO L290 TraceCheckUtils]: 81: Hoare triple {24072#false} ~skip~0 := 0; {24072#false} is VALID [2022-04-27 15:42:05,479 INFO L290 TraceCheckUtils]: 82: Hoare triple {24072#false} assume !false; {24072#false} is VALID [2022-04-27 15:42:05,479 INFO L290 TraceCheckUtils]: 83: Hoare triple {24072#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,480 INFO L290 TraceCheckUtils]: 84: Hoare triple {24072#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,480 INFO L290 TraceCheckUtils]: 85: Hoare triple {24072#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,480 INFO L290 TraceCheckUtils]: 86: Hoare triple {24072#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,480 INFO L290 TraceCheckUtils]: 87: Hoare triple {24072#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,480 INFO L290 TraceCheckUtils]: 88: Hoare triple {24072#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,480 INFO L290 TraceCheckUtils]: 89: Hoare triple {24072#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,480 INFO L290 TraceCheckUtils]: 90: Hoare triple {24072#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,480 INFO L290 TraceCheckUtils]: 91: Hoare triple {24072#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,480 INFO L290 TraceCheckUtils]: 92: Hoare triple {24072#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,480 INFO L290 TraceCheckUtils]: 93: Hoare triple {24072#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,480 INFO L290 TraceCheckUtils]: 94: Hoare triple {24072#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,480 INFO L290 TraceCheckUtils]: 95: Hoare triple {24072#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,481 INFO L290 TraceCheckUtils]: 96: Hoare triple {24072#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,481 INFO L290 TraceCheckUtils]: 97: Hoare triple {24072#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,481 INFO L290 TraceCheckUtils]: 98: Hoare triple {24072#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,481 INFO L290 TraceCheckUtils]: 99: Hoare triple {24072#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,481 INFO L290 TraceCheckUtils]: 100: Hoare triple {24072#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,481 INFO L290 TraceCheckUtils]: 101: Hoare triple {24072#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,481 INFO L290 TraceCheckUtils]: 102: Hoare triple {24072#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,481 INFO L290 TraceCheckUtils]: 103: Hoare triple {24072#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,481 INFO L290 TraceCheckUtils]: 104: Hoare triple {24072#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,481 INFO L290 TraceCheckUtils]: 105: Hoare triple {24072#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,481 INFO L290 TraceCheckUtils]: 106: Hoare triple {24072#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,482 INFO L290 TraceCheckUtils]: 107: Hoare triple {24072#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,482 INFO L290 TraceCheckUtils]: 108: Hoare triple {24072#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,482 INFO L290 TraceCheckUtils]: 109: Hoare triple {24072#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,482 INFO L290 TraceCheckUtils]: 110: Hoare triple {24072#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,482 INFO L290 TraceCheckUtils]: 111: Hoare triple {24072#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {24072#false} is VALID [2022-04-27 15:42:05,482 INFO L290 TraceCheckUtils]: 112: Hoare triple {24072#false} assume 8640 == #t~mem75;havoc #t~mem75; {24072#false} is VALID [2022-04-27 15:42:05,482 INFO L290 TraceCheckUtils]: 113: Hoare triple {24072#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {24072#false} is VALID [2022-04-27 15:42:05,482 INFO L290 TraceCheckUtils]: 114: Hoare triple {24072#false} assume !(9 == ~blastFlag~0); {24072#false} is VALID [2022-04-27 15:42:05,482 INFO L290 TraceCheckUtils]: 115: Hoare triple {24072#false} assume !(12 == ~blastFlag~0); {24072#false} is VALID [2022-04-27 15:42:05,482 INFO L290 TraceCheckUtils]: 116: Hoare triple {24072#false} assume !false; {24072#false} is VALID [2022-04-27 15:42:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 15:42:05,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:42:05,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298782577] [2022-04-27 15:42:05,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298782577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:42:05,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:42:05,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:42:05,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413563955] [2022-04-27 15:42:05,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:42:05,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-27 15:42:05,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:42:05,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:05,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:05,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:42:05,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:42:05,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:42:05,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:42:05,559 INFO L87 Difference]: Start difference. First operand 319 states and 493 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:07,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:42:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:14,084 INFO L93 Difference]: Finished difference Result 670 states and 1038 transitions. [2022-04-27 15:42:14,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:42:14,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-27 15:42:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:42:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2022-04-27 15:42:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2022-04-27 15:42:14,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 503 transitions. [2022-04-27 15:42:14,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 503 edges. 503 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:14,414 INFO L225 Difference]: With dead ends: 670 [2022-04-27 15:42:14,414 INFO L226 Difference]: Without dead ends: 377 [2022-04-27 15:42:14,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:42:14,415 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 37 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:42:14,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 635 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-27 15:42:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-27 15:42:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 343. [2022-04-27 15:42:14,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:42:14,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 343 states, 338 states have (on average 1.5562130177514792) internal successors, (526), 338 states have internal predecessors, (526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:14,423 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 343 states, 338 states have (on average 1.5562130177514792) internal successors, (526), 338 states have internal predecessors, (526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:14,423 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 343 states, 338 states have (on average 1.5562130177514792) internal successors, (526), 338 states have internal predecessors, (526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:14,430 INFO L93 Difference]: Finished difference Result 377 states and 574 transitions. [2022-04-27 15:42:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 574 transitions. [2022-04-27 15:42:14,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:14,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:14,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 343 states, 338 states have (on average 1.5562130177514792) internal successors, (526), 338 states have internal predecessors, (526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 377 states. [2022-04-27 15:42:14,432 INFO L87 Difference]: Start difference. First operand has 343 states, 338 states have (on average 1.5562130177514792) internal successors, (526), 338 states have internal predecessors, (526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 377 states. [2022-04-27 15:42:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:14,439 INFO L93 Difference]: Finished difference Result 377 states and 574 transitions. [2022-04-27 15:42:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 574 transitions. [2022-04-27 15:42:14,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:14,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:14,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:42:14,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:42:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 338 states have (on average 1.5562130177514792) internal successors, (526), 338 states have internal predecessors, (526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 530 transitions. [2022-04-27 15:42:14,446 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 530 transitions. Word has length 117 [2022-04-27 15:42:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:42:14,446 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 530 transitions. [2022-04-27 15:42:14,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 530 transitions. [2022-04-27 15:42:14,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-27 15:42:14,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:42:14,448 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-04-27 15:42:14,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:42:14,448 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:42:14,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:42:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1458638089, now seen corresponding path program 1 times [2022-04-27 15:42:14,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:42:14,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522009221] [2022-04-27 15:42:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:42:14,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:42:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:14,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:42:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:14,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {25984#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25977#true} is VALID [2022-04-27 15:42:14,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {25977#true} assume true; {25977#true} is VALID [2022-04-27 15:42:14,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25977#true} {25977#true} #720#return; {25977#true} is VALID [2022-04-27 15:42:14,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {25977#true} call ULTIMATE.init(); {25984#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:42:14,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {25984#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25977#true} is VALID [2022-04-27 15:42:14,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {25977#true} assume true; {25977#true} is VALID [2022-04-27 15:42:14,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25977#true} {25977#true} #720#return; {25977#true} is VALID [2022-04-27 15:42:14,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {25977#true} call #t~ret161 := main(); {25977#true} is VALID [2022-04-27 15:42:14,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {25977#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {25977#true} is VALID [2022-04-27 15:42:14,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {25977#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {25977#true} is VALID [2022-04-27 15:42:14,569 INFO L272 TraceCheckUtils]: 7: Hoare triple {25977#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25977#true} is VALID [2022-04-27 15:42:14,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {25977#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {25977#true} is VALID [2022-04-27 15:42:14,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {25977#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {25977#true} is VALID [2022-04-27 15:42:14,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {25977#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {25977#true} is VALID [2022-04-27 15:42:14,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {25977#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25977#true} is VALID [2022-04-27 15:42:14,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {25977#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {25977#true} is VALID [2022-04-27 15:42:14,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {25977#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {25977#true} is VALID [2022-04-27 15:42:14,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {25977#true} assume !false; {25977#true} is VALID [2022-04-27 15:42:14,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {25977#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25977#true} is VALID [2022-04-27 15:42:14,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {25977#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25977#true} is VALID [2022-04-27 15:42:14,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {25977#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25977#true} is VALID [2022-04-27 15:42:14,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {25977#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25977#true} is VALID [2022-04-27 15:42:14,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {25977#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25977#true} is VALID [2022-04-27 15:42:14,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {25977#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25977#true} is VALID [2022-04-27 15:42:14,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {25977#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25977#true} is VALID [2022-04-27 15:42:14,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {25977#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25977#true} is VALID [2022-04-27 15:42:14,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {25977#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25977#true} is VALID [2022-04-27 15:42:14,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {25977#true} assume 8464 == #t~mem55;havoc #t~mem55; {25977#true} is VALID [2022-04-27 15:42:14,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {25977#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25977#true} is VALID [2022-04-27 15:42:14,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {25977#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25977#true} is VALID [2022-04-27 15:42:14,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {25977#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {25982#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:14,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {25982#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {25982#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:14,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {25982#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25982#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:14,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {25982#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {25982#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:14,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {25982#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {25982#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:14,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {25982#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25983#(= |ssl3_accept_#t~mem47| 8496)} is VALID [2022-04-27 15:42:14,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {25983#(= |ssl3_accept_#t~mem47| 8496)} assume 12292 == #t~mem47;havoc #t~mem47; {25978#false} is VALID [2022-04-27 15:42:14,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {25978#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {25978#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {25978#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {25978#false} is VALID [2022-04-27 15:42:14,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {25978#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {25978#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {25978#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {25978#false} is VALID [2022-04-27 15:42:14,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {25978#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,574 INFO L290 TraceCheckUtils]: 41: Hoare triple {25978#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,575 INFO L290 TraceCheckUtils]: 42: Hoare triple {25978#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,575 INFO L290 TraceCheckUtils]: 43: Hoare triple {25978#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25978#false} is VALID [2022-04-27 15:42:14,575 INFO L290 TraceCheckUtils]: 44: Hoare triple {25978#false} ~skip~0 := 0; {25978#false} is VALID [2022-04-27 15:42:14,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {25978#false} assume !false; {25978#false} is VALID [2022-04-27 15:42:14,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {25978#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {25978#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,575 INFO L290 TraceCheckUtils]: 48: Hoare triple {25978#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,575 INFO L290 TraceCheckUtils]: 49: Hoare triple {25978#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,575 INFO L290 TraceCheckUtils]: 50: Hoare triple {25978#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,575 INFO L290 TraceCheckUtils]: 51: Hoare triple {25978#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,575 INFO L290 TraceCheckUtils]: 52: Hoare triple {25978#false} assume 8480 == #t~mem52;havoc #t~mem52; {25978#false} is VALID [2022-04-27 15:42:14,576 INFO L290 TraceCheckUtils]: 53: Hoare triple {25978#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {25978#false} is VALID [2022-04-27 15:42:14,576 INFO L290 TraceCheckUtils]: 54: Hoare triple {25978#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,576 INFO L290 TraceCheckUtils]: 55: Hoare triple {25978#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,576 INFO L290 TraceCheckUtils]: 56: Hoare triple {25978#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25978#false} is VALID [2022-04-27 15:42:14,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {25978#false} ~skip~0 := 0; {25978#false} is VALID [2022-04-27 15:42:14,576 INFO L290 TraceCheckUtils]: 58: Hoare triple {25978#false} assume !false; {25978#false} is VALID [2022-04-27 15:42:14,576 INFO L290 TraceCheckUtils]: 59: Hoare triple {25978#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,576 INFO L290 TraceCheckUtils]: 60: Hoare triple {25978#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,576 INFO L290 TraceCheckUtils]: 61: Hoare triple {25978#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,576 INFO L290 TraceCheckUtils]: 62: Hoare triple {25978#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,576 INFO L290 TraceCheckUtils]: 63: Hoare triple {25978#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,576 INFO L290 TraceCheckUtils]: 64: Hoare triple {25978#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,577 INFO L290 TraceCheckUtils]: 65: Hoare triple {25978#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,577 INFO L290 TraceCheckUtils]: 66: Hoare triple {25978#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,577 INFO L290 TraceCheckUtils]: 67: Hoare triple {25978#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,577 INFO L290 TraceCheckUtils]: 68: Hoare triple {25978#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,577 INFO L290 TraceCheckUtils]: 69: Hoare triple {25978#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,577 INFO L290 TraceCheckUtils]: 70: Hoare triple {25978#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,577 INFO L290 TraceCheckUtils]: 71: Hoare triple {25978#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,577 INFO L290 TraceCheckUtils]: 72: Hoare triple {25978#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,577 INFO L290 TraceCheckUtils]: 73: Hoare triple {25978#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,577 INFO L290 TraceCheckUtils]: 74: Hoare triple {25978#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,577 INFO L290 TraceCheckUtils]: 75: Hoare triple {25978#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,577 INFO L290 TraceCheckUtils]: 76: Hoare triple {25978#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,578 INFO L290 TraceCheckUtils]: 77: Hoare triple {25978#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,578 INFO L290 TraceCheckUtils]: 78: Hoare triple {25978#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,578 INFO L290 TraceCheckUtils]: 79: Hoare triple {25978#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,578 INFO L290 TraceCheckUtils]: 80: Hoare triple {25978#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,578 INFO L290 TraceCheckUtils]: 81: Hoare triple {25978#false} assume 8448 == #t~mem68;havoc #t~mem68; {25978#false} is VALID [2022-04-27 15:42:14,578 INFO L290 TraceCheckUtils]: 82: Hoare triple {25978#false} assume !(~num1~0 > 0); {25978#false} is VALID [2022-04-27 15:42:14,578 INFO L290 TraceCheckUtils]: 83: Hoare triple {25978#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {25978#false} is VALID [2022-04-27 15:42:14,578 INFO L290 TraceCheckUtils]: 84: Hoare triple {25978#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,578 INFO L290 TraceCheckUtils]: 85: Hoare triple {25978#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25978#false} is VALID [2022-04-27 15:42:14,578 INFO L290 TraceCheckUtils]: 86: Hoare triple {25978#false} ~skip~0 := 0; {25978#false} is VALID [2022-04-27 15:42:14,578 INFO L290 TraceCheckUtils]: 87: Hoare triple {25978#false} assume !false; {25978#false} is VALID [2022-04-27 15:42:14,578 INFO L290 TraceCheckUtils]: 88: Hoare triple {25978#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,579 INFO L290 TraceCheckUtils]: 89: Hoare triple {25978#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,579 INFO L290 TraceCheckUtils]: 90: Hoare triple {25978#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,579 INFO L290 TraceCheckUtils]: 91: Hoare triple {25978#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,579 INFO L290 TraceCheckUtils]: 92: Hoare triple {25978#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,579 INFO L290 TraceCheckUtils]: 93: Hoare triple {25978#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,579 INFO L290 TraceCheckUtils]: 94: Hoare triple {25978#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,579 INFO L290 TraceCheckUtils]: 95: Hoare triple {25978#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,579 INFO L290 TraceCheckUtils]: 96: Hoare triple {25978#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,579 INFO L290 TraceCheckUtils]: 97: Hoare triple {25978#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,579 INFO L290 TraceCheckUtils]: 98: Hoare triple {25978#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,579 INFO L290 TraceCheckUtils]: 99: Hoare triple {25978#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,580 INFO L290 TraceCheckUtils]: 100: Hoare triple {25978#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,580 INFO L290 TraceCheckUtils]: 101: Hoare triple {25978#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,580 INFO L290 TraceCheckUtils]: 102: Hoare triple {25978#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,580 INFO L290 TraceCheckUtils]: 103: Hoare triple {25978#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,580 INFO L290 TraceCheckUtils]: 104: Hoare triple {25978#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,580 INFO L290 TraceCheckUtils]: 105: Hoare triple {25978#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,580 INFO L290 TraceCheckUtils]: 106: Hoare triple {25978#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,580 INFO L290 TraceCheckUtils]: 107: Hoare triple {25978#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,580 INFO L290 TraceCheckUtils]: 108: Hoare triple {25978#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,580 INFO L290 TraceCheckUtils]: 109: Hoare triple {25978#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,580 INFO L290 TraceCheckUtils]: 110: Hoare triple {25978#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,580 INFO L290 TraceCheckUtils]: 111: Hoare triple {25978#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,581 INFO L290 TraceCheckUtils]: 112: Hoare triple {25978#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,581 INFO L290 TraceCheckUtils]: 113: Hoare triple {25978#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,581 INFO L290 TraceCheckUtils]: 114: Hoare triple {25978#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,581 INFO L290 TraceCheckUtils]: 115: Hoare triple {25978#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,581 INFO L290 TraceCheckUtils]: 116: Hoare triple {25978#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {25978#false} is VALID [2022-04-27 15:42:14,581 INFO L290 TraceCheckUtils]: 117: Hoare triple {25978#false} assume 8640 == #t~mem75;havoc #t~mem75; {25978#false} is VALID [2022-04-27 15:42:14,581 INFO L290 TraceCheckUtils]: 118: Hoare triple {25978#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {25978#false} is VALID [2022-04-27 15:42:14,581 INFO L290 TraceCheckUtils]: 119: Hoare triple {25978#false} assume !(9 == ~blastFlag~0); {25978#false} is VALID [2022-04-27 15:42:14,581 INFO L290 TraceCheckUtils]: 120: Hoare triple {25978#false} assume !(12 == ~blastFlag~0); {25978#false} is VALID [2022-04-27 15:42:14,581 INFO L290 TraceCheckUtils]: 121: Hoare triple {25978#false} assume !false; {25978#false} is VALID [2022-04-27 15:42:14,582 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-27 15:42:14,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:42:14,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522009221] [2022-04-27 15:42:14,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522009221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:42:14,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:42:14,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:42:14,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93638103] [2022-04-27 15:42:14,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:42:14,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-27 15:42:14,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:42:14,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:14,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:14,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:42:14,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:42:14,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:42:14,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:42:14,654 INFO L87 Difference]: Start difference. First operand 343 states and 530 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:19,164 INFO L93 Difference]: Finished difference Result 667 states and 1040 transitions. [2022-04-27 15:42:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:42:19,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-27 15:42:19,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:42:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-27 15:42:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-27 15:42:19,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-27 15:42:19,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:19,459 INFO L225 Difference]: With dead ends: 667 [2022-04-27 15:42:19,460 INFO L226 Difference]: Without dead ends: 350 [2022-04-27 15:42:19,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:42:19,461 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 30 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:42:19,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 555 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-27 15:42:19,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-04-27 15:42:19,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 343. [2022-04-27 15:42:19,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:42:19,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states. Second operand has 343 states, 338 states have (on average 1.5532544378698225) internal successors, (525), 338 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:19,469 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand has 343 states, 338 states have (on average 1.5532544378698225) internal successors, (525), 338 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:19,469 INFO L87 Difference]: Start difference. First operand 350 states. Second operand has 343 states, 338 states have (on average 1.5532544378698225) internal successors, (525), 338 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:19,475 INFO L93 Difference]: Finished difference Result 350 states and 539 transitions. [2022-04-27 15:42:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 539 transitions. [2022-04-27 15:42:19,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:19,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:19,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 343 states, 338 states have (on average 1.5532544378698225) internal successors, (525), 338 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 350 states. [2022-04-27 15:42:19,477 INFO L87 Difference]: Start difference. First operand has 343 states, 338 states have (on average 1.5532544378698225) internal successors, (525), 338 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 350 states. [2022-04-27 15:42:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:19,483 INFO L93 Difference]: Finished difference Result 350 states and 539 transitions. [2022-04-27 15:42:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 539 transitions. [2022-04-27 15:42:19,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:19,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:19,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:42:19,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:42:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 338 states have (on average 1.5532544378698225) internal successors, (525), 338 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 529 transitions. [2022-04-27 15:42:19,491 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 529 transitions. Word has length 122 [2022-04-27 15:42:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:42:19,491 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 529 transitions. [2022-04-27 15:42:19,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 529 transitions. [2022-04-27 15:42:19,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-27 15:42:19,492 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:42:19,492 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-04-27 15:42:19,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:42:19,492 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:42:19,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:42:19,493 INFO L85 PathProgramCache]: Analyzing trace with hash 625950851, now seen corresponding path program 1 times [2022-04-27 15:42:19,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:42:19,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098332035] [2022-04-27 15:42:19,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:42:19,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:42:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:19,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:42:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:19,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {27830#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27823#true} is VALID [2022-04-27 15:42:19,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {27823#true} assume true; {27823#true} is VALID [2022-04-27 15:42:19,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27823#true} {27823#true} #720#return; {27823#true} is VALID [2022-04-27 15:42:19,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {27823#true} call ULTIMATE.init(); {27830#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:42:19,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {27830#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27823#true} is VALID [2022-04-27 15:42:19,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {27823#true} assume true; {27823#true} is VALID [2022-04-27 15:42:19,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27823#true} {27823#true} #720#return; {27823#true} is VALID [2022-04-27 15:42:19,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {27823#true} call #t~ret161 := main(); {27823#true} is VALID [2022-04-27 15:42:19,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {27823#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {27823#true} is VALID [2022-04-27 15:42:19,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {27823#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,619 INFO L272 TraceCheckUtils]: 7: Hoare triple {27823#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27823#true} is VALID [2022-04-27 15:42:19,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {27823#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {27823#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {27823#true} is VALID [2022-04-27 15:42:19,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {27823#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {27823#true} is VALID [2022-04-27 15:42:19,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {27823#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27823#true} is VALID [2022-04-27 15:42:19,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {27823#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {27823#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {27823#true} is VALID [2022-04-27 15:42:19,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {27823#true} assume !false; {27823#true} is VALID [2022-04-27 15:42:19,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {27823#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {27823#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {27823#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {27823#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {27823#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {27823#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {27823#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {27823#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {27823#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {27823#true} assume 8464 == #t~mem55;havoc #t~mem55; {27823#true} is VALID [2022-04-27 15:42:19,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {27823#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {27823#true} is VALID [2022-04-27 15:42:19,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {27823#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27823#true} is VALID [2022-04-27 15:42:19,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {27823#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {27823#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {27823#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27823#true} is VALID [2022-04-27 15:42:19,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {27823#true} ~skip~0 := 0; {27823#true} is VALID [2022-04-27 15:42:19,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {27823#true} assume !false; {27823#true} is VALID [2022-04-27 15:42:19,622 INFO L290 TraceCheckUtils]: 32: Hoare triple {27823#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {27823#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {27823#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {27823#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,622 INFO L290 TraceCheckUtils]: 36: Hoare triple {27823#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {27823#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {27823#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {27823#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {27823#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {27823#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {27823#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,623 INFO L290 TraceCheckUtils]: 43: Hoare triple {27823#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {27823#true} assume 8496 == #t~mem58;havoc #t~mem58; {27823#true} is VALID [2022-04-27 15:42:19,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {27823#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {27823#true} is VALID [2022-04-27 15:42:19,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {27823#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {27823#true} is VALID [2022-04-27 15:42:19,623 INFO L290 TraceCheckUtils]: 47: Hoare triple {27823#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {27823#true} is VALID [2022-04-27 15:42:19,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {27823#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,625 INFO L290 TraceCheckUtils]: 50: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,625 INFO L290 TraceCheckUtils]: 51: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,626 INFO L290 TraceCheckUtils]: 52: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,626 INFO L290 TraceCheckUtils]: 53: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,626 INFO L290 TraceCheckUtils]: 54: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,627 INFO L290 TraceCheckUtils]: 55: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,627 INFO L290 TraceCheckUtils]: 56: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,628 INFO L290 TraceCheckUtils]: 57: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,628 INFO L290 TraceCheckUtils]: 58: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,628 INFO L290 TraceCheckUtils]: 59: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,629 INFO L290 TraceCheckUtils]: 60: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,629 INFO L290 TraceCheckUtils]: 61: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,630 INFO L290 TraceCheckUtils]: 62: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,630 INFO L290 TraceCheckUtils]: 63: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,630 INFO L290 TraceCheckUtils]: 64: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,631 INFO L290 TraceCheckUtils]: 65: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,631 INFO L290 TraceCheckUtils]: 66: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,632 INFO L290 TraceCheckUtils]: 67: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,632 INFO L290 TraceCheckUtils]: 68: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,633 INFO L290 TraceCheckUtils]: 69: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,633 INFO L290 TraceCheckUtils]: 70: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,633 INFO L290 TraceCheckUtils]: 71: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,634 INFO L290 TraceCheckUtils]: 72: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,634 INFO L290 TraceCheckUtils]: 73: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,635 INFO L290 TraceCheckUtils]: 74: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,635 INFO L290 TraceCheckUtils]: 75: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,635 INFO L290 TraceCheckUtils]: 76: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,636 INFO L290 TraceCheckUtils]: 77: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,636 INFO L290 TraceCheckUtils]: 78: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,637 INFO L290 TraceCheckUtils]: 79: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:19,637 INFO L290 TraceCheckUtils]: 80: Hoare triple {27828#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {27829#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-27 15:42:19,637 INFO L290 TraceCheckUtils]: 81: Hoare triple {27829#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {27824#false} is VALID [2022-04-27 15:42:19,637 INFO L290 TraceCheckUtils]: 82: Hoare triple {27824#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {27824#false} is VALID [2022-04-27 15:42:19,637 INFO L290 TraceCheckUtils]: 83: Hoare triple {27824#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {27824#false} is VALID [2022-04-27 15:42:19,638 INFO L290 TraceCheckUtils]: 84: Hoare triple {27824#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,638 INFO L290 TraceCheckUtils]: 85: Hoare triple {27824#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,638 INFO L290 TraceCheckUtils]: 86: Hoare triple {27824#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27824#false} is VALID [2022-04-27 15:42:19,638 INFO L290 TraceCheckUtils]: 87: Hoare triple {27824#false} ~skip~0 := 0; {27824#false} is VALID [2022-04-27 15:42:19,638 INFO L290 TraceCheckUtils]: 88: Hoare triple {27824#false} assume !false; {27824#false} is VALID [2022-04-27 15:42:19,638 INFO L290 TraceCheckUtils]: 89: Hoare triple {27824#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,638 INFO L290 TraceCheckUtils]: 90: Hoare triple {27824#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,638 INFO L290 TraceCheckUtils]: 91: Hoare triple {27824#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,638 INFO L290 TraceCheckUtils]: 92: Hoare triple {27824#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,638 INFO L290 TraceCheckUtils]: 93: Hoare triple {27824#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,638 INFO L290 TraceCheckUtils]: 94: Hoare triple {27824#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,638 INFO L290 TraceCheckUtils]: 95: Hoare triple {27824#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,638 INFO L290 TraceCheckUtils]: 96: Hoare triple {27824#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,639 INFO L290 TraceCheckUtils]: 97: Hoare triple {27824#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,639 INFO L290 TraceCheckUtils]: 98: Hoare triple {27824#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,639 INFO L290 TraceCheckUtils]: 99: Hoare triple {27824#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,639 INFO L290 TraceCheckUtils]: 100: Hoare triple {27824#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,639 INFO L290 TraceCheckUtils]: 101: Hoare triple {27824#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,639 INFO L290 TraceCheckUtils]: 102: Hoare triple {27824#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,639 INFO L290 TraceCheckUtils]: 103: Hoare triple {27824#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,639 INFO L290 TraceCheckUtils]: 104: Hoare triple {27824#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,639 INFO L290 TraceCheckUtils]: 105: Hoare triple {27824#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,639 INFO L290 TraceCheckUtils]: 106: Hoare triple {27824#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,639 INFO L290 TraceCheckUtils]: 107: Hoare triple {27824#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,639 INFO L290 TraceCheckUtils]: 108: Hoare triple {27824#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,640 INFO L290 TraceCheckUtils]: 109: Hoare triple {27824#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,640 INFO L290 TraceCheckUtils]: 110: Hoare triple {27824#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,640 INFO L290 TraceCheckUtils]: 111: Hoare triple {27824#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,640 INFO L290 TraceCheckUtils]: 112: Hoare triple {27824#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,640 INFO L290 TraceCheckUtils]: 113: Hoare triple {27824#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,640 INFO L290 TraceCheckUtils]: 114: Hoare triple {27824#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,640 INFO L290 TraceCheckUtils]: 115: Hoare triple {27824#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,640 INFO L290 TraceCheckUtils]: 116: Hoare triple {27824#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,640 INFO L290 TraceCheckUtils]: 117: Hoare triple {27824#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {27824#false} is VALID [2022-04-27 15:42:19,640 INFO L290 TraceCheckUtils]: 118: Hoare triple {27824#false} assume 8640 == #t~mem75;havoc #t~mem75; {27824#false} is VALID [2022-04-27 15:42:19,640 INFO L290 TraceCheckUtils]: 119: Hoare triple {27824#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {27824#false} is VALID [2022-04-27 15:42:19,640 INFO L290 TraceCheckUtils]: 120: Hoare triple {27824#false} assume !(9 == ~blastFlag~0); {27824#false} is VALID [2022-04-27 15:42:19,640 INFO L290 TraceCheckUtils]: 121: Hoare triple {27824#false} assume !(12 == ~blastFlag~0); {27824#false} is VALID [2022-04-27 15:42:19,641 INFO L290 TraceCheckUtils]: 122: Hoare triple {27824#false} assume !false; {27824#false} is VALID [2022-04-27 15:42:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:42:19,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:42:19,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098332035] [2022-04-27 15:42:19,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098332035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:42:19,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:42:19,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:42:19,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591342390] [2022-04-27 15:42:19,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:42:19,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-27 15:42:19,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:42:19,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:19,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:19,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:42:19,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:42:19,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:42:19,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:42:19,740 INFO L87 Difference]: Start difference. First operand 343 states and 529 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:25,539 INFO L93 Difference]: Finished difference Result 791 states and 1225 transitions. [2022-04-27 15:42:25,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:42:25,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-27 15:42:25,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:42:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2022-04-27 15:42:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2022-04-27 15:42:25,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 618 transitions. [2022-04-27 15:42:25,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:25,965 INFO L225 Difference]: With dead ends: 791 [2022-04-27 15:42:25,965 INFO L226 Difference]: Without dead ends: 474 [2022-04-27 15:42:25,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:42:25,966 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 129 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:42:25,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 374 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-27 15:42:25,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-04-27 15:42:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 380. [2022-04-27 15:42:25,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:42:25,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand has 380 states, 375 states have (on average 1.5653333333333332) internal successors, (587), 375 states have internal predecessors, (587), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:25,974 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand has 380 states, 375 states have (on average 1.5653333333333332) internal successors, (587), 375 states have internal predecessors, (587), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:25,974 INFO L87 Difference]: Start difference. First operand 474 states. Second operand has 380 states, 375 states have (on average 1.5653333333333332) internal successors, (587), 375 states have internal predecessors, (587), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:25,984 INFO L93 Difference]: Finished difference Result 474 states and 724 transitions. [2022-04-27 15:42:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 724 transitions. [2022-04-27 15:42:25,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:25,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:25,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 380 states, 375 states have (on average 1.5653333333333332) internal successors, (587), 375 states have internal predecessors, (587), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 474 states. [2022-04-27 15:42:25,986 INFO L87 Difference]: Start difference. First operand has 380 states, 375 states have (on average 1.5653333333333332) internal successors, (587), 375 states have internal predecessors, (587), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 474 states. [2022-04-27 15:42:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:25,997 INFO L93 Difference]: Finished difference Result 474 states and 724 transitions. [2022-04-27 15:42:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 724 transitions. [2022-04-27 15:42:25,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:25,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:25,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:42:25,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:42:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 375 states have (on average 1.5653333333333332) internal successors, (587), 375 states have internal predecessors, (587), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 591 transitions. [2022-04-27 15:42:26,006 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 591 transitions. Word has length 123 [2022-04-27 15:42:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:42:26,006 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 591 transitions. [2022-04-27 15:42:26,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 591 transitions. [2022-04-27 15:42:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-27 15:42:26,007 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:42:26,007 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:42:26,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:42:26,008 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:42:26,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:42:26,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1960942629, now seen corresponding path program 1 times [2022-04-27 15:42:26,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:42:26,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342132980] [2022-04-27 15:42:26,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:42:26,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:42:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:26,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:42:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:26,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {30108#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30101#true} is VALID [2022-04-27 15:42:26,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {30101#true} assume true; {30101#true} is VALID [2022-04-27 15:42:26,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30101#true} {30101#true} #720#return; {30101#true} is VALID [2022-04-27 15:42:26,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {30101#true} call ULTIMATE.init(); {30108#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:42:26,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {30108#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30101#true} is VALID [2022-04-27 15:42:26,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {30101#true} assume true; {30101#true} is VALID [2022-04-27 15:42:26,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30101#true} {30101#true} #720#return; {30101#true} is VALID [2022-04-27 15:42:26,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {30101#true} call #t~ret161 := main(); {30101#true} is VALID [2022-04-27 15:42:26,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {30101#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {30101#true} is VALID [2022-04-27 15:42:26,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {30101#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,133 INFO L272 TraceCheckUtils]: 7: Hoare triple {30101#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30101#true} is VALID [2022-04-27 15:42:26,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {30101#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {30101#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {30101#true} is VALID [2022-04-27 15:42:26,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {30101#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {30101#true} is VALID [2022-04-27 15:42:26,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {30101#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30101#true} is VALID [2022-04-27 15:42:26,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {30101#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {30101#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {30101#true} is VALID [2022-04-27 15:42:26,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {30101#true} assume !false; {30101#true} is VALID [2022-04-27 15:42:26,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {30101#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {30101#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {30101#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {30101#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {30101#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {30101#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {30101#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {30101#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {30101#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {30101#true} assume 8464 == #t~mem55;havoc #t~mem55; {30101#true} is VALID [2022-04-27 15:42:26,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {30101#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30101#true} is VALID [2022-04-27 15:42:26,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {30101#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30101#true} is VALID [2022-04-27 15:42:26,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {30101#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {30101#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {30101#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30101#true} is VALID [2022-04-27 15:42:26,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {30101#true} ~skip~0 := 0; {30101#true} is VALID [2022-04-27 15:42:26,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {30101#true} assume !false; {30101#true} is VALID [2022-04-27 15:42:26,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {30101#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {30101#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {30101#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {30101#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,136 INFO L290 TraceCheckUtils]: 36: Hoare triple {30101#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {30101#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {30101#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,136 INFO L290 TraceCheckUtils]: 39: Hoare triple {30101#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {30101#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {30101#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {30101#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {30101#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,136 INFO L290 TraceCheckUtils]: 44: Hoare triple {30101#true} assume 8496 == #t~mem58;havoc #t~mem58; {30101#true} is VALID [2022-04-27 15:42:26,137 INFO L290 TraceCheckUtils]: 45: Hoare triple {30101#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {30101#true} is VALID [2022-04-27 15:42:26,137 INFO L290 TraceCheckUtils]: 46: Hoare triple {30101#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30101#true} is VALID [2022-04-27 15:42:26,137 INFO L290 TraceCheckUtils]: 47: Hoare triple {30101#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {30101#true} is VALID [2022-04-27 15:42:26,137 INFO L290 TraceCheckUtils]: 48: Hoare triple {30101#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,139 INFO L290 TraceCheckUtils]: 51: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,139 INFO L290 TraceCheckUtils]: 52: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,140 INFO L290 TraceCheckUtils]: 53: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,140 INFO L290 TraceCheckUtils]: 54: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,140 INFO L290 TraceCheckUtils]: 55: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,142 INFO L290 TraceCheckUtils]: 58: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,142 INFO L290 TraceCheckUtils]: 59: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,143 INFO L290 TraceCheckUtils]: 60: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,143 INFO L290 TraceCheckUtils]: 61: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,143 INFO L290 TraceCheckUtils]: 62: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,144 INFO L290 TraceCheckUtils]: 63: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,144 INFO L290 TraceCheckUtils]: 64: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,145 INFO L290 TraceCheckUtils]: 65: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,145 INFO L290 TraceCheckUtils]: 66: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,145 INFO L290 TraceCheckUtils]: 67: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,146 INFO L290 TraceCheckUtils]: 68: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,146 INFO L290 TraceCheckUtils]: 69: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,147 INFO L290 TraceCheckUtils]: 70: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,147 INFO L290 TraceCheckUtils]: 71: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,147 INFO L290 TraceCheckUtils]: 72: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,148 INFO L290 TraceCheckUtils]: 73: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,148 INFO L290 TraceCheckUtils]: 74: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,149 INFO L290 TraceCheckUtils]: 75: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,149 INFO L290 TraceCheckUtils]: 76: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,150 INFO L290 TraceCheckUtils]: 77: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,150 INFO L290 TraceCheckUtils]: 78: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,150 INFO L290 TraceCheckUtils]: 79: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,151 INFO L290 TraceCheckUtils]: 80: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:26,151 INFO L290 TraceCheckUtils]: 81: Hoare triple {30106#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {30107#(= |ssl3_accept_#t~mem74| 8656)} is VALID [2022-04-27 15:42:26,152 INFO L290 TraceCheckUtils]: 82: Hoare triple {30107#(= |ssl3_accept_#t~mem74| 8656)} assume 8609 == #t~mem74;havoc #t~mem74; {30102#false} is VALID [2022-04-27 15:42:26,152 INFO L290 TraceCheckUtils]: 83: Hoare triple {30102#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {30102#false} is VALID [2022-04-27 15:42:26,152 INFO L290 TraceCheckUtils]: 84: Hoare triple {30102#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {30102#false} is VALID [2022-04-27 15:42:26,152 INFO L290 TraceCheckUtils]: 85: Hoare triple {30102#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,152 INFO L290 TraceCheckUtils]: 86: Hoare triple {30102#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,152 INFO L290 TraceCheckUtils]: 87: Hoare triple {30102#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30102#false} is VALID [2022-04-27 15:42:26,152 INFO L290 TraceCheckUtils]: 88: Hoare triple {30102#false} ~skip~0 := 0; {30102#false} is VALID [2022-04-27 15:42:26,152 INFO L290 TraceCheckUtils]: 89: Hoare triple {30102#false} assume !false; {30102#false} is VALID [2022-04-27 15:42:26,152 INFO L290 TraceCheckUtils]: 90: Hoare triple {30102#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,152 INFO L290 TraceCheckUtils]: 91: Hoare triple {30102#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,152 INFO L290 TraceCheckUtils]: 92: Hoare triple {30102#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,153 INFO L290 TraceCheckUtils]: 93: Hoare triple {30102#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,153 INFO L290 TraceCheckUtils]: 94: Hoare triple {30102#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,153 INFO L290 TraceCheckUtils]: 95: Hoare triple {30102#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,153 INFO L290 TraceCheckUtils]: 96: Hoare triple {30102#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,153 INFO L290 TraceCheckUtils]: 97: Hoare triple {30102#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,153 INFO L290 TraceCheckUtils]: 98: Hoare triple {30102#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,153 INFO L290 TraceCheckUtils]: 99: Hoare triple {30102#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,153 INFO L290 TraceCheckUtils]: 100: Hoare triple {30102#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,153 INFO L290 TraceCheckUtils]: 101: Hoare triple {30102#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,153 INFO L290 TraceCheckUtils]: 102: Hoare triple {30102#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,153 INFO L290 TraceCheckUtils]: 103: Hoare triple {30102#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,153 INFO L290 TraceCheckUtils]: 104: Hoare triple {30102#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,154 INFO L290 TraceCheckUtils]: 105: Hoare triple {30102#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,154 INFO L290 TraceCheckUtils]: 106: Hoare triple {30102#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,154 INFO L290 TraceCheckUtils]: 107: Hoare triple {30102#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,154 INFO L290 TraceCheckUtils]: 108: Hoare triple {30102#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,154 INFO L290 TraceCheckUtils]: 109: Hoare triple {30102#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,154 INFO L290 TraceCheckUtils]: 110: Hoare triple {30102#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,154 INFO L290 TraceCheckUtils]: 111: Hoare triple {30102#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,154 INFO L290 TraceCheckUtils]: 112: Hoare triple {30102#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,154 INFO L290 TraceCheckUtils]: 113: Hoare triple {30102#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,154 INFO L290 TraceCheckUtils]: 114: Hoare triple {30102#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,154 INFO L290 TraceCheckUtils]: 115: Hoare triple {30102#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,154 INFO L290 TraceCheckUtils]: 116: Hoare triple {30102#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,155 INFO L290 TraceCheckUtils]: 117: Hoare triple {30102#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,155 INFO L290 TraceCheckUtils]: 118: Hoare triple {30102#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {30102#false} is VALID [2022-04-27 15:42:26,155 INFO L290 TraceCheckUtils]: 119: Hoare triple {30102#false} assume 8640 == #t~mem75;havoc #t~mem75; {30102#false} is VALID [2022-04-27 15:42:26,155 INFO L290 TraceCheckUtils]: 120: Hoare triple {30102#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {30102#false} is VALID [2022-04-27 15:42:26,155 INFO L290 TraceCheckUtils]: 121: Hoare triple {30102#false} assume !(9 == ~blastFlag~0); {30102#false} is VALID [2022-04-27 15:42:26,155 INFO L290 TraceCheckUtils]: 122: Hoare triple {30102#false} assume !(12 == ~blastFlag~0); {30102#false} is VALID [2022-04-27 15:42:26,155 INFO L290 TraceCheckUtils]: 123: Hoare triple {30102#false} assume !false; {30102#false} is VALID [2022-04-27 15:42:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:42:26,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:42:26,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342132980] [2022-04-27 15:42:26,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342132980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:42:26,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:42:26,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:42:26,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605901385] [2022-04-27 15:42:26,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:42:26,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-27 15:42:26,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:42:26,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:26,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:26,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:42:26,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:42:26,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:42:26,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:42:26,239 INFO L87 Difference]: Start difference. First operand 380 states and 591 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:30,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:42:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:33,315 INFO L93 Difference]: Finished difference Result 806 states and 1254 transitions. [2022-04-27 15:42:33,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:42:33,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-27 15:42:33,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:42:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-27 15:42:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-27 15:42:33,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 577 transitions. [2022-04-27 15:42:33,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:33,705 INFO L225 Difference]: With dead ends: 806 [2022-04-27 15:42:33,705 INFO L226 Difference]: Without dead ends: 452 [2022-04-27 15:42:33,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:42:33,707 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 84 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:42:33,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 501 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-27 15:42:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-04-27 15:42:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 386. [2022-04-27 15:42:33,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:42:33,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 452 states. Second operand has 386 states, 381 states have (on average 1.5669291338582678) internal successors, (597), 381 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:33,715 INFO L74 IsIncluded]: Start isIncluded. First operand 452 states. Second operand has 386 states, 381 states have (on average 1.5669291338582678) internal successors, (597), 381 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:33,715 INFO L87 Difference]: Start difference. First operand 452 states. Second operand has 386 states, 381 states have (on average 1.5669291338582678) internal successors, (597), 381 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:33,725 INFO L93 Difference]: Finished difference Result 452 states and 692 transitions. [2022-04-27 15:42:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 692 transitions. [2022-04-27 15:42:33,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:33,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:33,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 386 states, 381 states have (on average 1.5669291338582678) internal successors, (597), 381 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 452 states. [2022-04-27 15:42:33,726 INFO L87 Difference]: Start difference. First operand has 386 states, 381 states have (on average 1.5669291338582678) internal successors, (597), 381 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 452 states. [2022-04-27 15:42:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:33,736 INFO L93 Difference]: Finished difference Result 452 states and 692 transitions. [2022-04-27 15:42:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 692 transitions. [2022-04-27 15:42:33,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:33,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:33,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:42:33,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:42:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 381 states have (on average 1.5669291338582678) internal successors, (597), 381 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 601 transitions. [2022-04-27 15:42:33,746 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 601 transitions. Word has length 124 [2022-04-27 15:42:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:42:33,746 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 601 transitions. [2022-04-27 15:42:33,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 601 transitions. [2022-04-27 15:42:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-27 15:42:33,748 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:42:33,748 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:42:33,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:42:33,748 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:42:33,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:42:33,749 INFO L85 PathProgramCache]: Analyzing trace with hash -203127122, now seen corresponding path program 1 times [2022-04-27 15:42:33,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:42:33,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489181464] [2022-04-27 15:42:33,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:42:33,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:42:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:33,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:42:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:33,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {32360#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32353#true} is VALID [2022-04-27 15:42:33,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {32353#true} assume true; {32353#true} is VALID [2022-04-27 15:42:33,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32353#true} {32353#true} #720#return; {32353#true} is VALID [2022-04-27 15:42:33,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {32353#true} call ULTIMATE.init(); {32360#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:42:33,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {32360#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32353#true} is VALID [2022-04-27 15:42:33,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {32353#true} assume true; {32353#true} is VALID [2022-04-27 15:42:33,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32353#true} {32353#true} #720#return; {32353#true} is VALID [2022-04-27 15:42:33,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {32353#true} call #t~ret161 := main(); {32353#true} is VALID [2022-04-27 15:42:33,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {32353#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {32353#true} is VALID [2022-04-27 15:42:33,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {32353#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,887 INFO L272 TraceCheckUtils]: 7: Hoare triple {32353#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32353#true} is VALID [2022-04-27 15:42:33,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {32353#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {32353#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {32353#true} is VALID [2022-04-27 15:42:33,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {32353#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {32353#true} is VALID [2022-04-27 15:42:33,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {32353#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32353#true} is VALID [2022-04-27 15:42:33,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {32353#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {32353#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {32353#true} is VALID [2022-04-27 15:42:33,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {32353#true} assume !false; {32353#true} is VALID [2022-04-27 15:42:33,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {32353#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {32353#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {32353#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {32353#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {32353#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {32353#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {32353#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {32353#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {32353#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {32353#true} assume 8464 == #t~mem55;havoc #t~mem55; {32353#true} is VALID [2022-04-27 15:42:33,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {32353#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {32353#true} is VALID [2022-04-27 15:42:33,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {32353#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32353#true} is VALID [2022-04-27 15:42:33,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {32353#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {32353#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {32353#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32353#true} is VALID [2022-04-27 15:42:33,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {32353#true} ~skip~0 := 0; {32353#true} is VALID [2022-04-27 15:42:33,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {32353#true} assume !false; {32353#true} is VALID [2022-04-27 15:42:33,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {32353#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {32353#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,889 INFO L290 TraceCheckUtils]: 34: Hoare triple {32353#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {32353#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {32353#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {32353#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {32353#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,889 INFO L290 TraceCheckUtils]: 39: Hoare triple {32353#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {32353#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {32353#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,890 INFO L290 TraceCheckUtils]: 42: Hoare triple {32353#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,890 INFO L290 TraceCheckUtils]: 43: Hoare triple {32353#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {32353#true} assume 8496 == #t~mem58;havoc #t~mem58; {32353#true} is VALID [2022-04-27 15:42:33,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {32353#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {32353#true} is VALID [2022-04-27 15:42:33,890 INFO L290 TraceCheckUtils]: 46: Hoare triple {32353#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {32353#true} is VALID [2022-04-27 15:42:33,890 INFO L290 TraceCheckUtils]: 47: Hoare triple {32353#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {32353#true} is VALID [2022-04-27 15:42:33,891 INFO L290 TraceCheckUtils]: 48: Hoare triple {32353#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:33,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:33,892 INFO L290 TraceCheckUtils]: 50: Hoare triple {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:33,892 INFO L290 TraceCheckUtils]: 51: Hoare triple {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:33,893 INFO L290 TraceCheckUtils]: 52: Hoare triple {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:33,893 INFO L290 TraceCheckUtils]: 53: Hoare triple {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:33,894 INFO L290 TraceCheckUtils]: 54: Hoare triple {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:33,894 INFO L290 TraceCheckUtils]: 55: Hoare triple {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:33,894 INFO L290 TraceCheckUtils]: 56: Hoare triple {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:33,895 INFO L290 TraceCheckUtils]: 57: Hoare triple {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:33,895 INFO L290 TraceCheckUtils]: 58: Hoare triple {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:33,896 INFO L290 TraceCheckUtils]: 59: Hoare triple {32358#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32359#(= |ssl3_accept_#t~mem52| 8656)} is VALID [2022-04-27 15:42:33,896 INFO L290 TraceCheckUtils]: 60: Hoare triple {32359#(= |ssl3_accept_#t~mem52| 8656)} assume 8480 == #t~mem52;havoc #t~mem52; {32354#false} is VALID [2022-04-27 15:42:33,896 INFO L290 TraceCheckUtils]: 61: Hoare triple {32354#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {32354#false} is VALID [2022-04-27 15:42:33,896 INFO L290 TraceCheckUtils]: 62: Hoare triple {32354#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {32354#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {32354#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32354#false} is VALID [2022-04-27 15:42:33,896 INFO L290 TraceCheckUtils]: 65: Hoare triple {32354#false} ~skip~0 := 0; {32354#false} is VALID [2022-04-27 15:42:33,897 INFO L290 TraceCheckUtils]: 66: Hoare triple {32354#false} assume !false; {32354#false} is VALID [2022-04-27 15:42:33,897 INFO L290 TraceCheckUtils]: 67: Hoare triple {32354#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,897 INFO L290 TraceCheckUtils]: 68: Hoare triple {32354#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,897 INFO L290 TraceCheckUtils]: 69: Hoare triple {32354#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,897 INFO L290 TraceCheckUtils]: 70: Hoare triple {32354#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,897 INFO L290 TraceCheckUtils]: 71: Hoare triple {32354#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,897 INFO L290 TraceCheckUtils]: 72: Hoare triple {32354#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,897 INFO L290 TraceCheckUtils]: 73: Hoare triple {32354#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,897 INFO L290 TraceCheckUtils]: 74: Hoare triple {32354#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,897 INFO L290 TraceCheckUtils]: 75: Hoare triple {32354#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,897 INFO L290 TraceCheckUtils]: 76: Hoare triple {32354#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,898 INFO L290 TraceCheckUtils]: 77: Hoare triple {32354#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,898 INFO L290 TraceCheckUtils]: 78: Hoare triple {32354#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,898 INFO L290 TraceCheckUtils]: 79: Hoare triple {32354#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,898 INFO L290 TraceCheckUtils]: 80: Hoare triple {32354#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,898 INFO L290 TraceCheckUtils]: 81: Hoare triple {32354#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,898 INFO L290 TraceCheckUtils]: 82: Hoare triple {32354#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,898 INFO L290 TraceCheckUtils]: 83: Hoare triple {32354#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,898 INFO L290 TraceCheckUtils]: 84: Hoare triple {32354#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,898 INFO L290 TraceCheckUtils]: 85: Hoare triple {32354#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,898 INFO L290 TraceCheckUtils]: 86: Hoare triple {32354#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,898 INFO L290 TraceCheckUtils]: 87: Hoare triple {32354#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,899 INFO L290 TraceCheckUtils]: 88: Hoare triple {32354#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,899 INFO L290 TraceCheckUtils]: 89: Hoare triple {32354#false} assume 8448 == #t~mem68;havoc #t~mem68; {32354#false} is VALID [2022-04-27 15:42:33,899 INFO L290 TraceCheckUtils]: 90: Hoare triple {32354#false} assume !(~num1~0 > 0); {32354#false} is VALID [2022-04-27 15:42:33,899 INFO L290 TraceCheckUtils]: 91: Hoare triple {32354#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {32354#false} is VALID [2022-04-27 15:42:33,899 INFO L290 TraceCheckUtils]: 92: Hoare triple {32354#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,899 INFO L290 TraceCheckUtils]: 93: Hoare triple {32354#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32354#false} is VALID [2022-04-27 15:42:33,899 INFO L290 TraceCheckUtils]: 94: Hoare triple {32354#false} ~skip~0 := 0; {32354#false} is VALID [2022-04-27 15:42:33,899 INFO L290 TraceCheckUtils]: 95: Hoare triple {32354#false} assume !false; {32354#false} is VALID [2022-04-27 15:42:33,899 INFO L290 TraceCheckUtils]: 96: Hoare triple {32354#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,899 INFO L290 TraceCheckUtils]: 97: Hoare triple {32354#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,899 INFO L290 TraceCheckUtils]: 98: Hoare triple {32354#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,899 INFO L290 TraceCheckUtils]: 99: Hoare triple {32354#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,900 INFO L290 TraceCheckUtils]: 100: Hoare triple {32354#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,900 INFO L290 TraceCheckUtils]: 101: Hoare triple {32354#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,900 INFO L290 TraceCheckUtils]: 102: Hoare triple {32354#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,900 INFO L290 TraceCheckUtils]: 103: Hoare triple {32354#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,900 INFO L290 TraceCheckUtils]: 104: Hoare triple {32354#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,900 INFO L290 TraceCheckUtils]: 105: Hoare triple {32354#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,900 INFO L290 TraceCheckUtils]: 106: Hoare triple {32354#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,900 INFO L290 TraceCheckUtils]: 107: Hoare triple {32354#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,900 INFO L290 TraceCheckUtils]: 108: Hoare triple {32354#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,900 INFO L290 TraceCheckUtils]: 109: Hoare triple {32354#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,901 INFO L290 TraceCheckUtils]: 110: Hoare triple {32354#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,901 INFO L290 TraceCheckUtils]: 111: Hoare triple {32354#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,901 INFO L290 TraceCheckUtils]: 112: Hoare triple {32354#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,901 INFO L290 TraceCheckUtils]: 113: Hoare triple {32354#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,901 INFO L290 TraceCheckUtils]: 114: Hoare triple {32354#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,901 INFO L290 TraceCheckUtils]: 115: Hoare triple {32354#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,901 INFO L290 TraceCheckUtils]: 116: Hoare triple {32354#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,901 INFO L290 TraceCheckUtils]: 117: Hoare triple {32354#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,901 INFO L290 TraceCheckUtils]: 118: Hoare triple {32354#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,901 INFO L290 TraceCheckUtils]: 119: Hoare triple {32354#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,902 INFO L290 TraceCheckUtils]: 120: Hoare triple {32354#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,902 INFO L290 TraceCheckUtils]: 121: Hoare triple {32354#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,902 INFO L290 TraceCheckUtils]: 122: Hoare triple {32354#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,902 INFO L290 TraceCheckUtils]: 123: Hoare triple {32354#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,902 INFO L290 TraceCheckUtils]: 124: Hoare triple {32354#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {32354#false} is VALID [2022-04-27 15:42:33,902 INFO L290 TraceCheckUtils]: 125: Hoare triple {32354#false} assume 8640 == #t~mem75;havoc #t~mem75; {32354#false} is VALID [2022-04-27 15:42:33,902 INFO L290 TraceCheckUtils]: 126: Hoare triple {32354#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {32354#false} is VALID [2022-04-27 15:42:33,902 INFO L290 TraceCheckUtils]: 127: Hoare triple {32354#false} assume !(9 == ~blastFlag~0); {32354#false} is VALID [2022-04-27 15:42:33,902 INFO L290 TraceCheckUtils]: 128: Hoare triple {32354#false} assume !(12 == ~blastFlag~0); {32354#false} is VALID [2022-04-27 15:42:33,902 INFO L290 TraceCheckUtils]: 129: Hoare triple {32354#false} assume !false; {32354#false} is VALID [2022-04-27 15:42:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 15:42:33,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:42:33,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489181464] [2022-04-27 15:42:33,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489181464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:42:33,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:42:33,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:42:33,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361574748] [2022-04-27 15:42:33,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:42:33,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-27 15:42:33,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:42:33,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:33,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:33,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:42:33,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:42:33,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:42:33,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:42:33,987 INFO L87 Difference]: Start difference. First operand 386 states and 601 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:36,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:42:40,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:40,599 INFO L93 Difference]: Finished difference Result 810 states and 1261 transitions. [2022-04-27 15:42:40,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:42:40,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-27 15:42:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:42:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-27 15:42:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-27 15:42:40,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-27 15:42:40,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:40,987 INFO L225 Difference]: With dead ends: 810 [2022-04-27 15:42:40,987 INFO L226 Difference]: Without dead ends: 450 [2022-04-27 15:42:40,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:42:40,988 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 105 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:42:40,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 503 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-27 15:42:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-04-27 15:42:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 386. [2022-04-27 15:42:40,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:42:40,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 450 states. Second operand has 386 states, 381 states have (on average 1.5643044619422573) internal successors, (596), 381 states have internal predecessors, (596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:40,996 INFO L74 IsIncluded]: Start isIncluded. First operand 450 states. Second operand has 386 states, 381 states have (on average 1.5643044619422573) internal successors, (596), 381 states have internal predecessors, (596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:40,996 INFO L87 Difference]: Start difference. First operand 450 states. Second operand has 386 states, 381 states have (on average 1.5643044619422573) internal successors, (596), 381 states have internal predecessors, (596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:41,006 INFO L93 Difference]: Finished difference Result 450 states and 689 transitions. [2022-04-27 15:42:41,006 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 689 transitions. [2022-04-27 15:42:41,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:41,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:41,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 386 states, 381 states have (on average 1.5643044619422573) internal successors, (596), 381 states have internal predecessors, (596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 450 states. [2022-04-27 15:42:41,008 INFO L87 Difference]: Start difference. First operand has 386 states, 381 states have (on average 1.5643044619422573) internal successors, (596), 381 states have internal predecessors, (596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 450 states. [2022-04-27 15:42:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:41,017 INFO L93 Difference]: Finished difference Result 450 states and 689 transitions. [2022-04-27 15:42:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 689 transitions. [2022-04-27 15:42:41,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:41,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:41,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:42:41,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:42:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 381 states have (on average 1.5643044619422573) internal successors, (596), 381 states have internal predecessors, (596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 600 transitions. [2022-04-27 15:42:41,027 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 600 transitions. Word has length 130 [2022-04-27 15:42:41,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:42:41,027 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 600 transitions. [2022-04-27 15:42:41,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 600 transitions. [2022-04-27 15:42:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-27 15:42:41,028 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:42:41,028 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:42:41,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:42:41,029 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:42:41,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:42:41,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1363630828, now seen corresponding path program 1 times [2022-04-27 15:42:41,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:42:41,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175171781] [2022-04-27 15:42:41,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:42:41,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:42:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:41,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:42:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:41,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {34611#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {34604#true} is VALID [2022-04-27 15:42:41,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {34604#true} assume true; {34604#true} is VALID [2022-04-27 15:42:41,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34604#true} {34604#true} #720#return; {34604#true} is VALID [2022-04-27 15:42:41,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {34604#true} call ULTIMATE.init(); {34611#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:42:41,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {34611#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {34604#true} is VALID [2022-04-27 15:42:41,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {34604#true} assume true; {34604#true} is VALID [2022-04-27 15:42:41,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34604#true} {34604#true} #720#return; {34604#true} is VALID [2022-04-27 15:42:41,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {34604#true} call #t~ret161 := main(); {34604#true} is VALID [2022-04-27 15:42:41,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {34604#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {34604#true} is VALID [2022-04-27 15:42:41,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {34604#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,153 INFO L272 TraceCheckUtils]: 7: Hoare triple {34604#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {34604#true} is VALID [2022-04-27 15:42:41,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {34604#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {34604#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {34604#true} is VALID [2022-04-27 15:42:41,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {34604#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {34604#true} is VALID [2022-04-27 15:42:41,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {34604#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {34604#true} is VALID [2022-04-27 15:42:41,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {34604#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {34604#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {34604#true} is VALID [2022-04-27 15:42:41,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {34604#true} assume !false; {34604#true} is VALID [2022-04-27 15:42:41,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {34604#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {34604#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {34604#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {34604#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {34604#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {34604#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {34604#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {34604#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {34604#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {34604#true} assume 8464 == #t~mem55;havoc #t~mem55; {34604#true} is VALID [2022-04-27 15:42:41,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {34604#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {34604#true} is VALID [2022-04-27 15:42:41,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {34604#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {34604#true} is VALID [2022-04-27 15:42:41,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {34604#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {34604#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {34604#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {34604#true} is VALID [2022-04-27 15:42:41,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {34604#true} ~skip~0 := 0; {34604#true} is VALID [2022-04-27 15:42:41,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {34604#true} assume !false; {34604#true} is VALID [2022-04-27 15:42:41,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {34604#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {34604#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {34604#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {34604#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {34604#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {34604#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {34604#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {34604#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {34604#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,156 INFO L290 TraceCheckUtils]: 41: Hoare triple {34604#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,156 INFO L290 TraceCheckUtils]: 42: Hoare triple {34604#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,156 INFO L290 TraceCheckUtils]: 43: Hoare triple {34604#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,156 INFO L290 TraceCheckUtils]: 44: Hoare triple {34604#true} assume 8496 == #t~mem58;havoc #t~mem58; {34604#true} is VALID [2022-04-27 15:42:41,156 INFO L290 TraceCheckUtils]: 45: Hoare triple {34604#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {34604#true} is VALID [2022-04-27 15:42:41,156 INFO L290 TraceCheckUtils]: 46: Hoare triple {34604#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {34604#true} is VALID [2022-04-27 15:42:41,157 INFO L290 TraceCheckUtils]: 47: Hoare triple {34604#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {34604#true} is VALID [2022-04-27 15:42:41,157 INFO L290 TraceCheckUtils]: 48: Hoare triple {34604#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:41,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:41,158 INFO L290 TraceCheckUtils]: 50: Hoare triple {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:41,159 INFO L290 TraceCheckUtils]: 51: Hoare triple {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:41,159 INFO L290 TraceCheckUtils]: 52: Hoare triple {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:41,160 INFO L290 TraceCheckUtils]: 53: Hoare triple {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:41,160 INFO L290 TraceCheckUtils]: 54: Hoare triple {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:41,160 INFO L290 TraceCheckUtils]: 55: Hoare triple {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:41,161 INFO L290 TraceCheckUtils]: 56: Hoare triple {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:41,161 INFO L290 TraceCheckUtils]: 57: Hoare triple {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:41,162 INFO L290 TraceCheckUtils]: 58: Hoare triple {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:42:41,162 INFO L290 TraceCheckUtils]: 59: Hoare triple {34609#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34610#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-27 15:42:41,162 INFO L290 TraceCheckUtils]: 60: Hoare triple {34610#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {34605#false} is VALID [2022-04-27 15:42:41,162 INFO L290 TraceCheckUtils]: 61: Hoare triple {34605#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {34605#false} is VALID [2022-04-27 15:42:41,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {34605#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {34605#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {34605#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {34605#false} is VALID [2022-04-27 15:42:41,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {34605#false} ~skip~0 := 0; {34605#false} is VALID [2022-04-27 15:42:41,163 INFO L290 TraceCheckUtils]: 66: Hoare triple {34605#false} assume !false; {34605#false} is VALID [2022-04-27 15:42:41,163 INFO L290 TraceCheckUtils]: 67: Hoare triple {34605#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,163 INFO L290 TraceCheckUtils]: 68: Hoare triple {34605#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,163 INFO L290 TraceCheckUtils]: 69: Hoare triple {34605#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,165 INFO L290 TraceCheckUtils]: 70: Hoare triple {34605#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,165 INFO L290 TraceCheckUtils]: 71: Hoare triple {34605#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,165 INFO L290 TraceCheckUtils]: 72: Hoare triple {34605#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,165 INFO L290 TraceCheckUtils]: 73: Hoare triple {34605#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,165 INFO L290 TraceCheckUtils]: 74: Hoare triple {34605#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,165 INFO L290 TraceCheckUtils]: 75: Hoare triple {34605#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,165 INFO L290 TraceCheckUtils]: 76: Hoare triple {34605#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,165 INFO L290 TraceCheckUtils]: 77: Hoare triple {34605#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,166 INFO L290 TraceCheckUtils]: 78: Hoare triple {34605#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,166 INFO L290 TraceCheckUtils]: 79: Hoare triple {34605#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,166 INFO L290 TraceCheckUtils]: 80: Hoare triple {34605#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,166 INFO L290 TraceCheckUtils]: 81: Hoare triple {34605#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,166 INFO L290 TraceCheckUtils]: 82: Hoare triple {34605#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,166 INFO L290 TraceCheckUtils]: 83: Hoare triple {34605#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,166 INFO L290 TraceCheckUtils]: 84: Hoare triple {34605#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,166 INFO L290 TraceCheckUtils]: 85: Hoare triple {34605#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,166 INFO L290 TraceCheckUtils]: 86: Hoare triple {34605#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,166 INFO L290 TraceCheckUtils]: 87: Hoare triple {34605#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,166 INFO L290 TraceCheckUtils]: 88: Hoare triple {34605#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,167 INFO L290 TraceCheckUtils]: 89: Hoare triple {34605#false} assume 8448 == #t~mem68;havoc #t~mem68; {34605#false} is VALID [2022-04-27 15:42:41,167 INFO L290 TraceCheckUtils]: 90: Hoare triple {34605#false} assume !(~num1~0 > 0); {34605#false} is VALID [2022-04-27 15:42:41,167 INFO L290 TraceCheckUtils]: 91: Hoare triple {34605#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {34605#false} is VALID [2022-04-27 15:42:41,167 INFO L290 TraceCheckUtils]: 92: Hoare triple {34605#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,167 INFO L290 TraceCheckUtils]: 93: Hoare triple {34605#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {34605#false} is VALID [2022-04-27 15:42:41,167 INFO L290 TraceCheckUtils]: 94: Hoare triple {34605#false} ~skip~0 := 0; {34605#false} is VALID [2022-04-27 15:42:41,167 INFO L290 TraceCheckUtils]: 95: Hoare triple {34605#false} assume !false; {34605#false} is VALID [2022-04-27 15:42:41,167 INFO L290 TraceCheckUtils]: 96: Hoare triple {34605#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,167 INFO L290 TraceCheckUtils]: 97: Hoare triple {34605#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,167 INFO L290 TraceCheckUtils]: 98: Hoare triple {34605#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,167 INFO L290 TraceCheckUtils]: 99: Hoare triple {34605#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,167 INFO L290 TraceCheckUtils]: 100: Hoare triple {34605#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,168 INFO L290 TraceCheckUtils]: 101: Hoare triple {34605#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,168 INFO L290 TraceCheckUtils]: 102: Hoare triple {34605#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,168 INFO L290 TraceCheckUtils]: 103: Hoare triple {34605#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,168 INFO L290 TraceCheckUtils]: 104: Hoare triple {34605#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,168 INFO L290 TraceCheckUtils]: 105: Hoare triple {34605#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,168 INFO L290 TraceCheckUtils]: 106: Hoare triple {34605#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,168 INFO L290 TraceCheckUtils]: 107: Hoare triple {34605#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,168 INFO L290 TraceCheckUtils]: 108: Hoare triple {34605#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,168 INFO L290 TraceCheckUtils]: 109: Hoare triple {34605#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,168 INFO L290 TraceCheckUtils]: 110: Hoare triple {34605#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,168 INFO L290 TraceCheckUtils]: 111: Hoare triple {34605#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,168 INFO L290 TraceCheckUtils]: 112: Hoare triple {34605#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,169 INFO L290 TraceCheckUtils]: 113: Hoare triple {34605#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,169 INFO L290 TraceCheckUtils]: 114: Hoare triple {34605#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,169 INFO L290 TraceCheckUtils]: 115: Hoare triple {34605#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,169 INFO L290 TraceCheckUtils]: 116: Hoare triple {34605#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,169 INFO L290 TraceCheckUtils]: 117: Hoare triple {34605#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,169 INFO L290 TraceCheckUtils]: 118: Hoare triple {34605#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,169 INFO L290 TraceCheckUtils]: 119: Hoare triple {34605#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,169 INFO L290 TraceCheckUtils]: 120: Hoare triple {34605#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,169 INFO L290 TraceCheckUtils]: 121: Hoare triple {34605#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,169 INFO L290 TraceCheckUtils]: 122: Hoare triple {34605#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,169 INFO L290 TraceCheckUtils]: 123: Hoare triple {34605#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,169 INFO L290 TraceCheckUtils]: 124: Hoare triple {34605#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {34605#false} is VALID [2022-04-27 15:42:41,170 INFO L290 TraceCheckUtils]: 125: Hoare triple {34605#false} assume 8640 == #t~mem75;havoc #t~mem75; {34605#false} is VALID [2022-04-27 15:42:41,170 INFO L290 TraceCheckUtils]: 126: Hoare triple {34605#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {34605#false} is VALID [2022-04-27 15:42:41,170 INFO L290 TraceCheckUtils]: 127: Hoare triple {34605#false} assume !(9 == ~blastFlag~0); {34605#false} is VALID [2022-04-27 15:42:41,170 INFO L290 TraceCheckUtils]: 128: Hoare triple {34605#false} assume !(12 == ~blastFlag~0); {34605#false} is VALID [2022-04-27 15:42:41,170 INFO L290 TraceCheckUtils]: 129: Hoare triple {34605#false} assume !false; {34605#false} is VALID [2022-04-27 15:42:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 15:42:41,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:42:41,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175171781] [2022-04-27 15:42:41,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175171781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:42:41,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:42:41,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:42:41,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581961955] [2022-04-27 15:42:41,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:42:41,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-27 15:42:41,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:42:41,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:41,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:41,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:42:41,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:42:41,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:42:41,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:42:41,249 INFO L87 Difference]: Start difference. First operand 386 states and 600 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:44,459 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:42:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:48,592 INFO L93 Difference]: Finished difference Result 835 states and 1297 transitions. [2022-04-27 15:42:48,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:42:48,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-27 15:42:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:42:48,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2022-04-27 15:42:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2022-04-27 15:42:48,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 616 transitions. [2022-04-27 15:42:48,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 616 edges. 616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:49,000 INFO L225 Difference]: With dead ends: 835 [2022-04-27 15:42:49,001 INFO L226 Difference]: Without dead ends: 475 [2022-04-27 15:42:49,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:42:49,002 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 150 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:42:49,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 378 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-27 15:42:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-27 15:42:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 386. [2022-04-27 15:42:49,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:42:49,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 386 states, 381 states have (on average 1.5538057742782152) internal successors, (592), 381 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:49,013 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 386 states, 381 states have (on average 1.5538057742782152) internal successors, (592), 381 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:49,014 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 386 states, 381 states have (on average 1.5538057742782152) internal successors, (592), 381 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:49,025 INFO L93 Difference]: Finished difference Result 475 states and 723 transitions. [2022-04-27 15:42:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 723 transitions. [2022-04-27 15:42:49,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:49,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:49,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 386 states, 381 states have (on average 1.5538057742782152) internal successors, (592), 381 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 475 states. [2022-04-27 15:42:49,026 INFO L87 Difference]: Start difference. First operand has 386 states, 381 states have (on average 1.5538057742782152) internal successors, (592), 381 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 475 states. [2022-04-27 15:42:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:49,037 INFO L93 Difference]: Finished difference Result 475 states and 723 transitions. [2022-04-27 15:42:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 723 transitions. [2022-04-27 15:42:49,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:49,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:49,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:42:49,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:42:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 381 states have (on average 1.5538057742782152) internal successors, (592), 381 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 596 transitions. [2022-04-27 15:42:49,047 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 596 transitions. Word has length 130 [2022-04-27 15:42:49,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:42:49,047 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 596 transitions. [2022-04-27 15:42:49,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 596 transitions. [2022-04-27 15:42:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:42:49,048 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:42:49,048 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:42:49,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 15:42:49,049 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:42:49,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:42:49,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1208648607, now seen corresponding path program 1 times [2022-04-27 15:42:49,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:42:49,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392926772] [2022-04-27 15:42:49,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:42:49,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:42:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:49,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:42:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:49,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {36942#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36935#true} is VALID [2022-04-27 15:42:49,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {36935#true} assume true; {36935#true} is VALID [2022-04-27 15:42:49,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36935#true} {36935#true} #720#return; {36935#true} is VALID [2022-04-27 15:42:49,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {36935#true} call ULTIMATE.init(); {36942#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:42:49,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {36942#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36935#true} is VALID [2022-04-27 15:42:49,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {36935#true} assume true; {36935#true} is VALID [2022-04-27 15:42:49,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36935#true} {36935#true} #720#return; {36935#true} is VALID [2022-04-27 15:42:49,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {36935#true} call #t~ret161 := main(); {36935#true} is VALID [2022-04-27 15:42:49,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {36935#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {36935#true} is VALID [2022-04-27 15:42:49,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {36935#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,197 INFO L272 TraceCheckUtils]: 7: Hoare triple {36935#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {36935#true} is VALID [2022-04-27 15:42:49,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {36935#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {36935#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {36935#true} is VALID [2022-04-27 15:42:49,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {36935#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {36935#true} is VALID [2022-04-27 15:42:49,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {36935#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36935#true} is VALID [2022-04-27 15:42:49,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {36935#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {36935#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {36935#true} is VALID [2022-04-27 15:42:49,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {36935#true} assume !false; {36935#true} is VALID [2022-04-27 15:42:49,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {36935#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {36935#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {36935#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {36935#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {36935#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {36935#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {36935#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {36935#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {36935#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {36935#true} assume 8464 == #t~mem55;havoc #t~mem55; {36935#true} is VALID [2022-04-27 15:42:49,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {36935#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {36935#true} is VALID [2022-04-27 15:42:49,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {36935#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36935#true} is VALID [2022-04-27 15:42:49,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {36935#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {36935#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {36935#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36935#true} is VALID [2022-04-27 15:42:49,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {36935#true} ~skip~0 := 0; {36935#true} is VALID [2022-04-27 15:42:49,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {36935#true} assume !false; {36935#true} is VALID [2022-04-27 15:42:49,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {36935#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {36935#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {36935#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {36935#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {36935#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {36935#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {36935#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {36935#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {36935#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {36935#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {36935#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,200 INFO L290 TraceCheckUtils]: 43: Hoare triple {36935#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {36935#true} assume 8496 == #t~mem58;havoc #t~mem58; {36935#true} is VALID [2022-04-27 15:42:49,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {36935#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {36935#true} is VALID [2022-04-27 15:42:49,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {36935#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {36935#true} is VALID [2022-04-27 15:42:49,200 INFO L290 TraceCheckUtils]: 47: Hoare triple {36935#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {36935#true} is VALID [2022-04-27 15:42:49,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {36935#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,202 INFO L290 TraceCheckUtils]: 49: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,202 INFO L290 TraceCheckUtils]: 50: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,203 INFO L290 TraceCheckUtils]: 51: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,203 INFO L290 TraceCheckUtils]: 53: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,204 INFO L290 TraceCheckUtils]: 55: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,204 INFO L290 TraceCheckUtils]: 56: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,205 INFO L290 TraceCheckUtils]: 57: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,205 INFO L290 TraceCheckUtils]: 58: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,206 INFO L290 TraceCheckUtils]: 59: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,207 INFO L290 TraceCheckUtils]: 62: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,207 INFO L290 TraceCheckUtils]: 63: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,207 INFO L290 TraceCheckUtils]: 64: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,208 INFO L290 TraceCheckUtils]: 65: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,208 INFO L290 TraceCheckUtils]: 66: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,208 INFO L290 TraceCheckUtils]: 67: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,209 INFO L290 TraceCheckUtils]: 68: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,209 INFO L290 TraceCheckUtils]: 69: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,210 INFO L290 TraceCheckUtils]: 70: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,210 INFO L290 TraceCheckUtils]: 71: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,210 INFO L290 TraceCheckUtils]: 72: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,211 INFO L290 TraceCheckUtils]: 74: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,211 INFO L290 TraceCheckUtils]: 75: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,212 INFO L290 TraceCheckUtils]: 76: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,212 INFO L290 TraceCheckUtils]: 77: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,212 INFO L290 TraceCheckUtils]: 78: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,213 INFO L290 TraceCheckUtils]: 79: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,213 INFO L290 TraceCheckUtils]: 80: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,214 INFO L290 TraceCheckUtils]: 81: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,214 INFO L290 TraceCheckUtils]: 82: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,214 INFO L290 TraceCheckUtils]: 83: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:49,215 INFO L290 TraceCheckUtils]: 84: Hoare triple {36940#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {36941#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-27 15:42:49,215 INFO L290 TraceCheckUtils]: 85: Hoare triple {36941#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,215 INFO L290 TraceCheckUtils]: 86: Hoare triple {36936#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,215 INFO L290 TraceCheckUtils]: 87: Hoare triple {36936#false} assume 8672 == #t~mem79;havoc #t~mem79; {36936#false} is VALID [2022-04-27 15:42:49,215 INFO L290 TraceCheckUtils]: 88: Hoare triple {36936#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {36936#false} is VALID [2022-04-27 15:42:49,215 INFO L290 TraceCheckUtils]: 89: Hoare triple {36936#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {36936#false} is VALID [2022-04-27 15:42:49,215 INFO L290 TraceCheckUtils]: 90: Hoare triple {36936#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,216 INFO L290 TraceCheckUtils]: 91: Hoare triple {36936#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {36936#false} is VALID [2022-04-27 15:42:49,216 INFO L290 TraceCheckUtils]: 92: Hoare triple {36936#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,216 INFO L290 TraceCheckUtils]: 93: Hoare triple {36936#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,216 INFO L290 TraceCheckUtils]: 94: Hoare triple {36936#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36936#false} is VALID [2022-04-27 15:42:49,216 INFO L290 TraceCheckUtils]: 95: Hoare triple {36936#false} ~skip~0 := 0; {36936#false} is VALID [2022-04-27 15:42:49,216 INFO L290 TraceCheckUtils]: 96: Hoare triple {36936#false} assume !false; {36936#false} is VALID [2022-04-27 15:42:49,216 INFO L290 TraceCheckUtils]: 97: Hoare triple {36936#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,216 INFO L290 TraceCheckUtils]: 98: Hoare triple {36936#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,216 INFO L290 TraceCheckUtils]: 99: Hoare triple {36936#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,216 INFO L290 TraceCheckUtils]: 100: Hoare triple {36936#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,216 INFO L290 TraceCheckUtils]: 101: Hoare triple {36936#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,216 INFO L290 TraceCheckUtils]: 102: Hoare triple {36936#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,216 INFO L290 TraceCheckUtils]: 103: Hoare triple {36936#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,217 INFO L290 TraceCheckUtils]: 104: Hoare triple {36936#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,217 INFO L290 TraceCheckUtils]: 105: Hoare triple {36936#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,217 INFO L290 TraceCheckUtils]: 106: Hoare triple {36936#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,217 INFO L290 TraceCheckUtils]: 107: Hoare triple {36936#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,217 INFO L290 TraceCheckUtils]: 108: Hoare triple {36936#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,217 INFO L290 TraceCheckUtils]: 109: Hoare triple {36936#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,217 INFO L290 TraceCheckUtils]: 110: Hoare triple {36936#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,217 INFO L290 TraceCheckUtils]: 111: Hoare triple {36936#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,217 INFO L290 TraceCheckUtils]: 112: Hoare triple {36936#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,217 INFO L290 TraceCheckUtils]: 113: Hoare triple {36936#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,217 INFO L290 TraceCheckUtils]: 114: Hoare triple {36936#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,217 INFO L290 TraceCheckUtils]: 115: Hoare triple {36936#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,217 INFO L290 TraceCheckUtils]: 116: Hoare triple {36936#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,218 INFO L290 TraceCheckUtils]: 117: Hoare triple {36936#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,218 INFO L290 TraceCheckUtils]: 118: Hoare triple {36936#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,218 INFO L290 TraceCheckUtils]: 119: Hoare triple {36936#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,218 INFO L290 TraceCheckUtils]: 120: Hoare triple {36936#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,218 INFO L290 TraceCheckUtils]: 121: Hoare triple {36936#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,218 INFO L290 TraceCheckUtils]: 122: Hoare triple {36936#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,218 INFO L290 TraceCheckUtils]: 123: Hoare triple {36936#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,218 INFO L290 TraceCheckUtils]: 124: Hoare triple {36936#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,218 INFO L290 TraceCheckUtils]: 125: Hoare triple {36936#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {36936#false} is VALID [2022-04-27 15:42:49,218 INFO L290 TraceCheckUtils]: 126: Hoare triple {36936#false} assume 8640 == #t~mem75;havoc #t~mem75; {36936#false} is VALID [2022-04-27 15:42:49,218 INFO L290 TraceCheckUtils]: 127: Hoare triple {36936#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {36936#false} is VALID [2022-04-27 15:42:49,218 INFO L290 TraceCheckUtils]: 128: Hoare triple {36936#false} assume !(9 == ~blastFlag~0); {36936#false} is VALID [2022-04-27 15:42:49,218 INFO L290 TraceCheckUtils]: 129: Hoare triple {36936#false} assume !(12 == ~blastFlag~0); {36936#false} is VALID [2022-04-27 15:42:49,219 INFO L290 TraceCheckUtils]: 130: Hoare triple {36936#false} assume !false; {36936#false} is VALID [2022-04-27 15:42:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:42:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:42:49,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392926772] [2022-04-27 15:42:49,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392926772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:42:49,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:42:49,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:42:49,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523029988] [2022-04-27 15:42:49,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:42:49,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-27 15:42:49,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:42:49,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:49,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:49,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:42:49,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:42:49,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:42:49,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:42:49,315 INFO L87 Difference]: Start difference. First operand 386 states and 596 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:51,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:42:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:55,419 INFO L93 Difference]: Finished difference Result 803 states and 1240 transitions. [2022-04-27 15:42:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:42:55,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-27 15:42:55,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:42:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-27 15:42:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-27 15:42:55,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 562 transitions. [2022-04-27 15:42:55,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 562 edges. 562 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:55,806 INFO L225 Difference]: With dead ends: 803 [2022-04-27 15:42:55,806 INFO L226 Difference]: Without dead ends: 443 [2022-04-27 15:42:55,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:42:55,807 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 69 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:42:55,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 511 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-27 15:42:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-04-27 15:42:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 389. [2022-04-27 15:42:55,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:42:55,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 443 states. Second operand has 389 states, 384 states have (on average 1.5494791666666667) internal successors, (595), 384 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:55,815 INFO L74 IsIncluded]: Start isIncluded. First operand 443 states. Second operand has 389 states, 384 states have (on average 1.5494791666666667) internal successors, (595), 384 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:55,815 INFO L87 Difference]: Start difference. First operand 443 states. Second operand has 389 states, 384 states have (on average 1.5494791666666667) internal successors, (595), 384 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:55,825 INFO L93 Difference]: Finished difference Result 443 states and 673 transitions. [2022-04-27 15:42:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 673 transitions. [2022-04-27 15:42:55,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:55,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:55,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.5494791666666667) internal successors, (595), 384 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 443 states. [2022-04-27 15:42:55,826 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.5494791666666667) internal successors, (595), 384 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 443 states. [2022-04-27 15:42:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:42:55,836 INFO L93 Difference]: Finished difference Result 443 states and 673 transitions. [2022-04-27 15:42:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 673 transitions. [2022-04-27 15:42:55,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:42:55,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:42:55,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:42:55,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:42:55,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.5494791666666667) internal successors, (595), 384 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 599 transitions. [2022-04-27 15:42:55,845 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 599 transitions. Word has length 131 [2022-04-27 15:42:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:42:55,846 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 599 transitions. [2022-04-27 15:42:55,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 599 transitions. [2022-04-27 15:42:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-27 15:42:55,847 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:42:55,847 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:42:55,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 15:42:55,847 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:42:55,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:42:55,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1448540058, now seen corresponding path program 1 times [2022-04-27 15:42:55,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:42:55,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254346293] [2022-04-27 15:42:55,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:42:55,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:42:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:55,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:42:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:42:55,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {39174#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {39167#true} is VALID [2022-04-27 15:42:55,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {39167#true} assume true; {39167#true} is VALID [2022-04-27 15:42:55,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39167#true} {39167#true} #720#return; {39167#true} is VALID [2022-04-27 15:42:55,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {39167#true} call ULTIMATE.init(); {39174#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:42:55,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {39174#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {39167#true} is VALID [2022-04-27 15:42:55,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {39167#true} assume true; {39167#true} is VALID [2022-04-27 15:42:55,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39167#true} {39167#true} #720#return; {39167#true} is VALID [2022-04-27 15:42:55,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {39167#true} call #t~ret161 := main(); {39167#true} is VALID [2022-04-27 15:42:55,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {39167#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {39167#true} is VALID [2022-04-27 15:42:55,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {39167#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,982 INFO L272 TraceCheckUtils]: 7: Hoare triple {39167#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {39167#true} is VALID [2022-04-27 15:42:55,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {39167#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {39167#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {39167#true} is VALID [2022-04-27 15:42:55,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {39167#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {39167#true} is VALID [2022-04-27 15:42:55,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {39167#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {39167#true} is VALID [2022-04-27 15:42:55,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {39167#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {39167#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {39167#true} is VALID [2022-04-27 15:42:55,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {39167#true} assume !false; {39167#true} is VALID [2022-04-27 15:42:55,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {39167#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {39167#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {39167#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {39167#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {39167#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {39167#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {39167#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {39167#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {39167#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {39167#true} assume 8464 == #t~mem55;havoc #t~mem55; {39167#true} is VALID [2022-04-27 15:42:55,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {39167#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {39167#true} is VALID [2022-04-27 15:42:55,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {39167#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {39167#true} is VALID [2022-04-27 15:42:55,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {39167#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {39167#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {39167#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39167#true} is VALID [2022-04-27 15:42:55,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {39167#true} ~skip~0 := 0; {39167#true} is VALID [2022-04-27 15:42:55,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {39167#true} assume !false; {39167#true} is VALID [2022-04-27 15:42:55,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {39167#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {39167#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {39167#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {39167#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {39167#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {39167#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {39167#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {39167#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {39167#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {39167#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {39167#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {39167#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,985 INFO L290 TraceCheckUtils]: 44: Hoare triple {39167#true} assume 8496 == #t~mem58;havoc #t~mem58; {39167#true} is VALID [2022-04-27 15:42:55,985 INFO L290 TraceCheckUtils]: 45: Hoare triple {39167#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {39167#true} is VALID [2022-04-27 15:42:55,985 INFO L290 TraceCheckUtils]: 46: Hoare triple {39167#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {39167#true} is VALID [2022-04-27 15:42:55,986 INFO L290 TraceCheckUtils]: 47: Hoare triple {39167#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {39167#true} is VALID [2022-04-27 15:42:55,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {39167#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:55,987 INFO L290 TraceCheckUtils]: 49: Hoare triple {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:55,987 INFO L290 TraceCheckUtils]: 50: Hoare triple {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:55,988 INFO L290 TraceCheckUtils]: 51: Hoare triple {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:55,988 INFO L290 TraceCheckUtils]: 52: Hoare triple {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:55,989 INFO L290 TraceCheckUtils]: 53: Hoare triple {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:55,989 INFO L290 TraceCheckUtils]: 54: Hoare triple {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:55,989 INFO L290 TraceCheckUtils]: 55: Hoare triple {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:55,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:42:55,990 INFO L290 TraceCheckUtils]: 57: Hoare triple {39172#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39173#(= |ssl3_accept_#t~mem50| 8656)} is VALID [2022-04-27 15:42:55,990 INFO L290 TraceCheckUtils]: 58: Hoare triple {39173#(= |ssl3_accept_#t~mem50| 8656)} assume 24576 == #t~mem50;havoc #t~mem50; {39168#false} is VALID [2022-04-27 15:42:55,991 INFO L290 TraceCheckUtils]: 59: Hoare triple {39168#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,991 INFO L290 TraceCheckUtils]: 60: Hoare triple {39168#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {39168#false} is VALID [2022-04-27 15:42:55,991 INFO L290 TraceCheckUtils]: 61: Hoare triple {39168#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,991 INFO L290 TraceCheckUtils]: 62: Hoare triple {39168#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,991 INFO L290 TraceCheckUtils]: 63: Hoare triple {39168#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {39168#false} is VALID [2022-04-27 15:42:55,991 INFO L290 TraceCheckUtils]: 64: Hoare triple {39168#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,991 INFO L290 TraceCheckUtils]: 65: Hoare triple {39168#false} assume 12292 != #t~mem85;havoc #t~mem85; {39168#false} is VALID [2022-04-27 15:42:55,991 INFO L290 TraceCheckUtils]: 66: Hoare triple {39168#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {39168#false} is VALID [2022-04-27 15:42:55,991 INFO L290 TraceCheckUtils]: 67: Hoare triple {39168#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,991 INFO L290 TraceCheckUtils]: 68: Hoare triple {39168#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39168#false} is VALID [2022-04-27 15:42:55,991 INFO L290 TraceCheckUtils]: 69: Hoare triple {39168#false} ~skip~0 := 0; {39168#false} is VALID [2022-04-27 15:42:55,992 INFO L290 TraceCheckUtils]: 70: Hoare triple {39168#false} assume !false; {39168#false} is VALID [2022-04-27 15:42:55,992 INFO L290 TraceCheckUtils]: 71: Hoare triple {39168#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,992 INFO L290 TraceCheckUtils]: 72: Hoare triple {39168#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,992 INFO L290 TraceCheckUtils]: 73: Hoare triple {39168#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,992 INFO L290 TraceCheckUtils]: 74: Hoare triple {39168#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,992 INFO L290 TraceCheckUtils]: 75: Hoare triple {39168#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,992 INFO L290 TraceCheckUtils]: 76: Hoare triple {39168#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,992 INFO L290 TraceCheckUtils]: 77: Hoare triple {39168#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,992 INFO L290 TraceCheckUtils]: 78: Hoare triple {39168#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,992 INFO L290 TraceCheckUtils]: 79: Hoare triple {39168#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,992 INFO L290 TraceCheckUtils]: 80: Hoare triple {39168#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,992 INFO L290 TraceCheckUtils]: 81: Hoare triple {39168#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,993 INFO L290 TraceCheckUtils]: 82: Hoare triple {39168#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,993 INFO L290 TraceCheckUtils]: 83: Hoare triple {39168#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,993 INFO L290 TraceCheckUtils]: 84: Hoare triple {39168#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,993 INFO L290 TraceCheckUtils]: 85: Hoare triple {39168#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,993 INFO L290 TraceCheckUtils]: 86: Hoare triple {39168#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,993 INFO L290 TraceCheckUtils]: 87: Hoare triple {39168#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,993 INFO L290 TraceCheckUtils]: 88: Hoare triple {39168#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,993 INFO L290 TraceCheckUtils]: 89: Hoare triple {39168#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,993 INFO L290 TraceCheckUtils]: 90: Hoare triple {39168#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,993 INFO L290 TraceCheckUtils]: 91: Hoare triple {39168#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,993 INFO L290 TraceCheckUtils]: 92: Hoare triple {39168#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,993 INFO L290 TraceCheckUtils]: 93: Hoare triple {39168#false} assume 8448 == #t~mem68;havoc #t~mem68; {39168#false} is VALID [2022-04-27 15:42:55,994 INFO L290 TraceCheckUtils]: 94: Hoare triple {39168#false} assume !(~num1~0 > 0); {39168#false} is VALID [2022-04-27 15:42:55,994 INFO L290 TraceCheckUtils]: 95: Hoare triple {39168#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {39168#false} is VALID [2022-04-27 15:42:55,994 INFO L290 TraceCheckUtils]: 96: Hoare triple {39168#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,994 INFO L290 TraceCheckUtils]: 97: Hoare triple {39168#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39168#false} is VALID [2022-04-27 15:42:55,994 INFO L290 TraceCheckUtils]: 98: Hoare triple {39168#false} ~skip~0 := 0; {39168#false} is VALID [2022-04-27 15:42:55,994 INFO L290 TraceCheckUtils]: 99: Hoare triple {39168#false} assume !false; {39168#false} is VALID [2022-04-27 15:42:55,994 INFO L290 TraceCheckUtils]: 100: Hoare triple {39168#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,994 INFO L290 TraceCheckUtils]: 101: Hoare triple {39168#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,994 INFO L290 TraceCheckUtils]: 102: Hoare triple {39168#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,994 INFO L290 TraceCheckUtils]: 103: Hoare triple {39168#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,994 INFO L290 TraceCheckUtils]: 104: Hoare triple {39168#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,994 INFO L290 TraceCheckUtils]: 105: Hoare triple {39168#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,995 INFO L290 TraceCheckUtils]: 106: Hoare triple {39168#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,995 INFO L290 TraceCheckUtils]: 107: Hoare triple {39168#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,995 INFO L290 TraceCheckUtils]: 108: Hoare triple {39168#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,995 INFO L290 TraceCheckUtils]: 109: Hoare triple {39168#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,995 INFO L290 TraceCheckUtils]: 110: Hoare triple {39168#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,995 INFO L290 TraceCheckUtils]: 111: Hoare triple {39168#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,995 INFO L290 TraceCheckUtils]: 112: Hoare triple {39168#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,995 INFO L290 TraceCheckUtils]: 113: Hoare triple {39168#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,995 INFO L290 TraceCheckUtils]: 114: Hoare triple {39168#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,995 INFO L290 TraceCheckUtils]: 115: Hoare triple {39168#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,995 INFO L290 TraceCheckUtils]: 116: Hoare triple {39168#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,995 INFO L290 TraceCheckUtils]: 117: Hoare triple {39168#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,996 INFO L290 TraceCheckUtils]: 118: Hoare triple {39168#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,996 INFO L290 TraceCheckUtils]: 119: Hoare triple {39168#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,996 INFO L290 TraceCheckUtils]: 120: Hoare triple {39168#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,996 INFO L290 TraceCheckUtils]: 121: Hoare triple {39168#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,996 INFO L290 TraceCheckUtils]: 122: Hoare triple {39168#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,996 INFO L290 TraceCheckUtils]: 123: Hoare triple {39168#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,996 INFO L290 TraceCheckUtils]: 124: Hoare triple {39168#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,996 INFO L290 TraceCheckUtils]: 125: Hoare triple {39168#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,996 INFO L290 TraceCheckUtils]: 126: Hoare triple {39168#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,996 INFO L290 TraceCheckUtils]: 127: Hoare triple {39168#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,996 INFO L290 TraceCheckUtils]: 128: Hoare triple {39168#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {39168#false} is VALID [2022-04-27 15:42:55,996 INFO L290 TraceCheckUtils]: 129: Hoare triple {39168#false} assume 8640 == #t~mem75;havoc #t~mem75; {39168#false} is VALID [2022-04-27 15:42:55,997 INFO L290 TraceCheckUtils]: 130: Hoare triple {39168#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {39168#false} is VALID [2022-04-27 15:42:55,997 INFO L290 TraceCheckUtils]: 131: Hoare triple {39168#false} assume !(9 == ~blastFlag~0); {39168#false} is VALID [2022-04-27 15:42:55,997 INFO L290 TraceCheckUtils]: 132: Hoare triple {39168#false} assume !(12 == ~blastFlag~0); {39168#false} is VALID [2022-04-27 15:42:55,997 INFO L290 TraceCheckUtils]: 133: Hoare triple {39168#false} assume !false; {39168#false} is VALID [2022-04-27 15:42:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 15:42:55,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:42:55,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254346293] [2022-04-27 15:42:55,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254346293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:42:55,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:42:55,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:42:55,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312475830] [2022-04-27 15:42:55,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:42:55,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-27 15:42:55,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:42:55,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:42:56,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:42:56,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:42:56,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:42:56,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:42:56,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:42:56,074 INFO L87 Difference]: Start difference. First operand 389 states and 599 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:02,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:02,107 INFO L93 Difference]: Finished difference Result 796 states and 1229 transitions. [2022-04-27 15:43:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:43:02,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-27 15:43:02,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:43:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2022-04-27 15:43:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2022-04-27 15:43:02,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 559 transitions. [2022-04-27 15:43:02,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:02,470 INFO L225 Difference]: With dead ends: 796 [2022-04-27 15:43:02,471 INFO L226 Difference]: Without dead ends: 433 [2022-04-27 15:43:02,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:43:02,472 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 94 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:43:02,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 513 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 15:43:02,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-04-27 15:43:02,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 389. [2022-04-27 15:43:02,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:43:02,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 433 states. Second operand has 389 states, 384 states have (on average 1.546875) internal successors, (594), 384 states have internal predecessors, (594), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:02,479 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states. Second operand has 389 states, 384 states have (on average 1.546875) internal successors, (594), 384 states have internal predecessors, (594), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:02,479 INFO L87 Difference]: Start difference. First operand 433 states. Second operand has 389 states, 384 states have (on average 1.546875) internal successors, (594), 384 states have internal predecessors, (594), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:02,488 INFO L93 Difference]: Finished difference Result 433 states and 659 transitions. [2022-04-27 15:43:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 659 transitions. [2022-04-27 15:43:02,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:02,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:02,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.546875) internal successors, (594), 384 states have internal predecessors, (594), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 433 states. [2022-04-27 15:43:02,489 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.546875) internal successors, (594), 384 states have internal predecessors, (594), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 433 states. [2022-04-27 15:43:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:02,499 INFO L93 Difference]: Finished difference Result 433 states and 659 transitions. [2022-04-27 15:43:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 659 transitions. [2022-04-27 15:43:02,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:02,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:02,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:43:02,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:43:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.546875) internal successors, (594), 384 states have internal predecessors, (594), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 598 transitions. [2022-04-27 15:43:02,508 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 598 transitions. Word has length 134 [2022-04-27 15:43:02,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:43:02,508 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 598 transitions. [2022-04-27 15:43:02,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 598 transitions. [2022-04-27 15:43:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-27 15:43:02,509 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:43:02,509 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:43:02,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 15:43:02,510 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:43:02,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:43:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash 887852452, now seen corresponding path program 1 times [2022-04-27 15:43:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:43:02,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849094425] [2022-04-27 15:43:02,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:43:02,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:43:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:43:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:02,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {41378#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {41371#true} is VALID [2022-04-27 15:43:02,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {41371#true} assume true; {41371#true} is VALID [2022-04-27 15:43:02,650 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41371#true} {41371#true} #720#return; {41371#true} is VALID [2022-04-27 15:43:02,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {41371#true} call ULTIMATE.init(); {41378#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:43:02,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {41378#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {41371#true} is VALID [2022-04-27 15:43:02,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {41371#true} assume true; {41371#true} is VALID [2022-04-27 15:43:02,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41371#true} {41371#true} #720#return; {41371#true} is VALID [2022-04-27 15:43:02,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {41371#true} call #t~ret161 := main(); {41371#true} is VALID [2022-04-27 15:43:02,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {41371#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {41371#true} is VALID [2022-04-27 15:43:02,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {41371#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,652 INFO L272 TraceCheckUtils]: 7: Hoare triple {41371#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {41371#true} is VALID [2022-04-27 15:43:02,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {41371#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {41371#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {41371#true} is VALID [2022-04-27 15:43:02,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {41371#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {41371#true} is VALID [2022-04-27 15:43:02,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {41371#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {41371#true} is VALID [2022-04-27 15:43:02,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {41371#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {41371#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {41371#true} is VALID [2022-04-27 15:43:02,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {41371#true} assume !false; {41371#true} is VALID [2022-04-27 15:43:02,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {41371#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {41371#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {41371#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {41371#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {41371#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {41371#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {41371#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {41371#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {41371#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {41371#true} assume 8464 == #t~mem55;havoc #t~mem55; {41371#true} is VALID [2022-04-27 15:43:02,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {41371#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {41371#true} is VALID [2022-04-27 15:43:02,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {41371#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {41371#true} is VALID [2022-04-27 15:43:02,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {41371#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {41371#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {41371#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41371#true} is VALID [2022-04-27 15:43:02,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {41371#true} ~skip~0 := 0; {41371#true} is VALID [2022-04-27 15:43:02,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {41371#true} assume !false; {41371#true} is VALID [2022-04-27 15:43:02,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {41371#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {41371#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {41371#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {41371#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {41371#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {41371#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {41371#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {41371#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,655 INFO L290 TraceCheckUtils]: 40: Hoare triple {41371#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {41371#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {41371#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {41371#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,655 INFO L290 TraceCheckUtils]: 44: Hoare triple {41371#true} assume 8496 == #t~mem58;havoc #t~mem58; {41371#true} is VALID [2022-04-27 15:43:02,655 INFO L290 TraceCheckUtils]: 45: Hoare triple {41371#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {41371#true} is VALID [2022-04-27 15:43:02,655 INFO L290 TraceCheckUtils]: 46: Hoare triple {41371#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {41371#true} is VALID [2022-04-27 15:43:02,655 INFO L290 TraceCheckUtils]: 47: Hoare triple {41371#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {41371#true} is VALID [2022-04-27 15:43:02,656 INFO L290 TraceCheckUtils]: 48: Hoare triple {41371#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:02,657 INFO L290 TraceCheckUtils]: 49: Hoare triple {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:02,657 INFO L290 TraceCheckUtils]: 50: Hoare triple {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:02,658 INFO L290 TraceCheckUtils]: 51: Hoare triple {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:02,658 INFO L290 TraceCheckUtils]: 52: Hoare triple {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:02,658 INFO L290 TraceCheckUtils]: 53: Hoare triple {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:02,659 INFO L290 TraceCheckUtils]: 54: Hoare triple {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:02,659 INFO L290 TraceCheckUtils]: 55: Hoare triple {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:02,660 INFO L290 TraceCheckUtils]: 56: Hoare triple {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:02,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {41376#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41377#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-27 15:43:02,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {41377#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {41372#false} is VALID [2022-04-27 15:43:02,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {41372#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {41372#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {41372#false} is VALID [2022-04-27 15:43:02,661 INFO L290 TraceCheckUtils]: 61: Hoare triple {41372#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,661 INFO L290 TraceCheckUtils]: 62: Hoare triple {41372#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,661 INFO L290 TraceCheckUtils]: 63: Hoare triple {41372#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {41372#false} is VALID [2022-04-27 15:43:02,661 INFO L290 TraceCheckUtils]: 64: Hoare triple {41372#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,661 INFO L290 TraceCheckUtils]: 65: Hoare triple {41372#false} assume 12292 != #t~mem85;havoc #t~mem85; {41372#false} is VALID [2022-04-27 15:43:02,661 INFO L290 TraceCheckUtils]: 66: Hoare triple {41372#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {41372#false} is VALID [2022-04-27 15:43:02,661 INFO L290 TraceCheckUtils]: 67: Hoare triple {41372#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,661 INFO L290 TraceCheckUtils]: 68: Hoare triple {41372#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41372#false} is VALID [2022-04-27 15:43:02,661 INFO L290 TraceCheckUtils]: 69: Hoare triple {41372#false} ~skip~0 := 0; {41372#false} is VALID [2022-04-27 15:43:02,661 INFO L290 TraceCheckUtils]: 70: Hoare triple {41372#false} assume !false; {41372#false} is VALID [2022-04-27 15:43:02,661 INFO L290 TraceCheckUtils]: 71: Hoare triple {41372#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,661 INFO L290 TraceCheckUtils]: 72: Hoare triple {41372#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,662 INFO L290 TraceCheckUtils]: 73: Hoare triple {41372#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,662 INFO L290 TraceCheckUtils]: 74: Hoare triple {41372#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,662 INFO L290 TraceCheckUtils]: 75: Hoare triple {41372#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,662 INFO L290 TraceCheckUtils]: 76: Hoare triple {41372#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,662 INFO L290 TraceCheckUtils]: 77: Hoare triple {41372#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,662 INFO L290 TraceCheckUtils]: 78: Hoare triple {41372#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,662 INFO L290 TraceCheckUtils]: 79: Hoare triple {41372#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,662 INFO L290 TraceCheckUtils]: 80: Hoare triple {41372#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,662 INFO L290 TraceCheckUtils]: 81: Hoare triple {41372#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,662 INFO L290 TraceCheckUtils]: 82: Hoare triple {41372#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,662 INFO L290 TraceCheckUtils]: 83: Hoare triple {41372#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,662 INFO L290 TraceCheckUtils]: 84: Hoare triple {41372#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,663 INFO L290 TraceCheckUtils]: 85: Hoare triple {41372#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,663 INFO L290 TraceCheckUtils]: 86: Hoare triple {41372#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,663 INFO L290 TraceCheckUtils]: 87: Hoare triple {41372#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,663 INFO L290 TraceCheckUtils]: 88: Hoare triple {41372#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,663 INFO L290 TraceCheckUtils]: 89: Hoare triple {41372#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,663 INFO L290 TraceCheckUtils]: 90: Hoare triple {41372#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,663 INFO L290 TraceCheckUtils]: 91: Hoare triple {41372#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,663 INFO L290 TraceCheckUtils]: 92: Hoare triple {41372#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,663 INFO L290 TraceCheckUtils]: 93: Hoare triple {41372#false} assume 8448 == #t~mem68;havoc #t~mem68; {41372#false} is VALID [2022-04-27 15:43:02,663 INFO L290 TraceCheckUtils]: 94: Hoare triple {41372#false} assume !(~num1~0 > 0); {41372#false} is VALID [2022-04-27 15:43:02,663 INFO L290 TraceCheckUtils]: 95: Hoare triple {41372#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {41372#false} is VALID [2022-04-27 15:43:02,664 INFO L290 TraceCheckUtils]: 96: Hoare triple {41372#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,664 INFO L290 TraceCheckUtils]: 97: Hoare triple {41372#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41372#false} is VALID [2022-04-27 15:43:02,664 INFO L290 TraceCheckUtils]: 98: Hoare triple {41372#false} ~skip~0 := 0; {41372#false} is VALID [2022-04-27 15:43:02,664 INFO L290 TraceCheckUtils]: 99: Hoare triple {41372#false} assume !false; {41372#false} is VALID [2022-04-27 15:43:02,664 INFO L290 TraceCheckUtils]: 100: Hoare triple {41372#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,664 INFO L290 TraceCheckUtils]: 101: Hoare triple {41372#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,664 INFO L290 TraceCheckUtils]: 102: Hoare triple {41372#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,664 INFO L290 TraceCheckUtils]: 103: Hoare triple {41372#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,664 INFO L290 TraceCheckUtils]: 104: Hoare triple {41372#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,664 INFO L290 TraceCheckUtils]: 105: Hoare triple {41372#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,664 INFO L290 TraceCheckUtils]: 106: Hoare triple {41372#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,664 INFO L290 TraceCheckUtils]: 107: Hoare triple {41372#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,665 INFO L290 TraceCheckUtils]: 108: Hoare triple {41372#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,665 INFO L290 TraceCheckUtils]: 109: Hoare triple {41372#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,665 INFO L290 TraceCheckUtils]: 110: Hoare triple {41372#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,665 INFO L290 TraceCheckUtils]: 111: Hoare triple {41372#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,665 INFO L290 TraceCheckUtils]: 112: Hoare triple {41372#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,665 INFO L290 TraceCheckUtils]: 113: Hoare triple {41372#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,665 INFO L290 TraceCheckUtils]: 114: Hoare triple {41372#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,665 INFO L290 TraceCheckUtils]: 115: Hoare triple {41372#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,665 INFO L290 TraceCheckUtils]: 116: Hoare triple {41372#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,665 INFO L290 TraceCheckUtils]: 117: Hoare triple {41372#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,665 INFO L290 TraceCheckUtils]: 118: Hoare triple {41372#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,665 INFO L290 TraceCheckUtils]: 119: Hoare triple {41372#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,666 INFO L290 TraceCheckUtils]: 120: Hoare triple {41372#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,666 INFO L290 TraceCheckUtils]: 121: Hoare triple {41372#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,666 INFO L290 TraceCheckUtils]: 122: Hoare triple {41372#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,666 INFO L290 TraceCheckUtils]: 123: Hoare triple {41372#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,666 INFO L290 TraceCheckUtils]: 124: Hoare triple {41372#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,666 INFO L290 TraceCheckUtils]: 125: Hoare triple {41372#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,666 INFO L290 TraceCheckUtils]: 126: Hoare triple {41372#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,666 INFO L290 TraceCheckUtils]: 127: Hoare triple {41372#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,666 INFO L290 TraceCheckUtils]: 128: Hoare triple {41372#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {41372#false} is VALID [2022-04-27 15:43:02,666 INFO L290 TraceCheckUtils]: 129: Hoare triple {41372#false} assume 8640 == #t~mem75;havoc #t~mem75; {41372#false} is VALID [2022-04-27 15:43:02,666 INFO L290 TraceCheckUtils]: 130: Hoare triple {41372#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {41372#false} is VALID [2022-04-27 15:43:02,666 INFO L290 TraceCheckUtils]: 131: Hoare triple {41372#false} assume !(9 == ~blastFlag~0); {41372#false} is VALID [2022-04-27 15:43:02,667 INFO L290 TraceCheckUtils]: 132: Hoare triple {41372#false} assume !(12 == ~blastFlag~0); {41372#false} is VALID [2022-04-27 15:43:02,667 INFO L290 TraceCheckUtils]: 133: Hoare triple {41372#false} assume !false; {41372#false} is VALID [2022-04-27 15:43:02,667 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 15:43:02,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:43:02,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849094425] [2022-04-27 15:43:02,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849094425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:43:02,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:43:02,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:43:02,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898446624] [2022-04-27 15:43:02,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:43:02,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-27 15:43:02,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:43:02,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:02,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:02,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:43:02,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:43:02,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:43:02,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:43:02,744 INFO L87 Difference]: Start difference. First operand 389 states and 598 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:07,452 INFO L93 Difference]: Finished difference Result 833 states and 1282 transitions. [2022-04-27 15:43:07,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:43:07,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-27 15:43:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:43:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2022-04-27 15:43:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2022-04-27 15:43:07,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 616 transitions. [2022-04-27 15:43:07,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 616 edges. 616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:07,883 INFO L225 Difference]: With dead ends: 833 [2022-04-27 15:43:07,883 INFO L226 Difference]: Without dead ends: 470 [2022-04-27 15:43:07,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:43:07,884 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 151 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:43:07,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 396 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:43:07,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-04-27 15:43:07,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 389. [2022-04-27 15:43:07,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:43:07,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 470 states. Second operand has 389 states, 384 states have (on average 1.5338541666666667) internal successors, (589), 384 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:07,894 INFO L74 IsIncluded]: Start isIncluded. First operand 470 states. Second operand has 389 states, 384 states have (on average 1.5338541666666667) internal successors, (589), 384 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:07,894 INFO L87 Difference]: Start difference. First operand 470 states. Second operand has 389 states, 384 states have (on average 1.5338541666666667) internal successors, (589), 384 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:07,903 INFO L93 Difference]: Finished difference Result 470 states and 709 transitions. [2022-04-27 15:43:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 709 transitions. [2022-04-27 15:43:07,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:07,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:07,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.5338541666666667) internal successors, (589), 384 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 470 states. [2022-04-27 15:43:07,904 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.5338541666666667) internal successors, (589), 384 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 470 states. [2022-04-27 15:43:07,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:07,914 INFO L93 Difference]: Finished difference Result 470 states and 709 transitions. [2022-04-27 15:43:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 709 transitions. [2022-04-27 15:43:07,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:07,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:07,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:43:07,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:43:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.5338541666666667) internal successors, (589), 384 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:07,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 593 transitions. [2022-04-27 15:43:07,921 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 593 transitions. Word has length 134 [2022-04-27 15:43:07,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:43:07,922 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 593 transitions. [2022-04-27 15:43:07,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 593 transitions. [2022-04-27 15:43:07,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-27 15:43:07,923 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:43:07,923 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-04-27 15:43:07,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 15:43:07,923 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:43:07,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:43:07,924 INFO L85 PathProgramCache]: Analyzing trace with hash -706262769, now seen corresponding path program 1 times [2022-04-27 15:43:07,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:43:07,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544675644] [2022-04-27 15:43:07,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:43:07,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:43:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:08,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:43:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:08,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {43700#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {43693#true} is VALID [2022-04-27 15:43:08,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {43693#true} assume true; {43693#true} is VALID [2022-04-27 15:43:08,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43693#true} {43693#true} #720#return; {43693#true} is VALID [2022-04-27 15:43:08,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {43693#true} call ULTIMATE.init(); {43700#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:43:08,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {43700#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {43693#true} is VALID [2022-04-27 15:43:08,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {43693#true} assume true; {43693#true} is VALID [2022-04-27 15:43:08,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43693#true} {43693#true} #720#return; {43693#true} is VALID [2022-04-27 15:43:08,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {43693#true} call #t~ret161 := main(); {43693#true} is VALID [2022-04-27 15:43:08,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {43693#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {43693#true} is VALID [2022-04-27 15:43:08,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {43693#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,064 INFO L272 TraceCheckUtils]: 7: Hoare triple {43693#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {43693#true} is VALID [2022-04-27 15:43:08,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {43693#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {43693#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {43693#true} is VALID [2022-04-27 15:43:08,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {43693#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {43693#true} is VALID [2022-04-27 15:43:08,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {43693#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {43693#true} is VALID [2022-04-27 15:43:08,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {43693#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {43693#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {43693#true} is VALID [2022-04-27 15:43:08,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {43693#true} assume !false; {43693#true} is VALID [2022-04-27 15:43:08,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {43693#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {43693#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {43693#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {43693#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {43693#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {43693#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {43693#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {43693#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {43693#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {43693#true} assume 8464 == #t~mem55;havoc #t~mem55; {43693#true} is VALID [2022-04-27 15:43:08,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {43693#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {43693#true} is VALID [2022-04-27 15:43:08,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {43693#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {43693#true} is VALID [2022-04-27 15:43:08,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {43693#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {43693#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {43693#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {43693#true} is VALID [2022-04-27 15:43:08,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {43693#true} ~skip~0 := 0; {43693#true} is VALID [2022-04-27 15:43:08,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {43693#true} assume !false; {43693#true} is VALID [2022-04-27 15:43:08,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {43693#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {43693#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {43693#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {43693#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {43693#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,067 INFO L290 TraceCheckUtils]: 37: Hoare triple {43693#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {43693#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {43693#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {43693#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {43693#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {43693#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {43693#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {43693#true} assume 8496 == #t~mem58;havoc #t~mem58; {43693#true} is VALID [2022-04-27 15:43:08,067 INFO L290 TraceCheckUtils]: 45: Hoare triple {43693#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {43693#true} is VALID [2022-04-27 15:43:08,067 INFO L290 TraceCheckUtils]: 46: Hoare triple {43693#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {43693#true} is VALID [2022-04-27 15:43:08,067 INFO L290 TraceCheckUtils]: 47: Hoare triple {43693#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {43693#true} is VALID [2022-04-27 15:43:08,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {43693#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,069 INFO L290 TraceCheckUtils]: 49: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,069 INFO L290 TraceCheckUtils]: 50: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,070 INFO L290 TraceCheckUtils]: 51: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,070 INFO L290 TraceCheckUtils]: 52: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} ~skip~0 := 0; {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,070 INFO L290 TraceCheckUtils]: 53: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !false; {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,071 INFO L290 TraceCheckUtils]: 55: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,073 INFO L290 TraceCheckUtils]: 59: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,073 INFO L290 TraceCheckUtils]: 60: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,074 INFO L290 TraceCheckUtils]: 61: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,074 INFO L290 TraceCheckUtils]: 62: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,074 INFO L290 TraceCheckUtils]: 63: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,075 INFO L290 TraceCheckUtils]: 64: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,075 INFO L290 TraceCheckUtils]: 65: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,076 INFO L290 TraceCheckUtils]: 66: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:43:08,076 INFO L290 TraceCheckUtils]: 67: Hoare triple {43698#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {43699#(not (= |ssl3_accept_#t~mem60| 8512))} is VALID [2022-04-27 15:43:08,076 INFO L290 TraceCheckUtils]: 68: Hoare triple {43699#(not (= |ssl3_accept_#t~mem60| 8512))} assume 8512 == #t~mem60;havoc #t~mem60; {43694#false} is VALID [2022-04-27 15:43:08,077 INFO L290 TraceCheckUtils]: 69: Hoare triple {43694#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,077 INFO L290 TraceCheckUtils]: 70: Hoare triple {43694#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {43694#false} is VALID [2022-04-27 15:43:08,077 INFO L290 TraceCheckUtils]: 71: Hoare triple {43694#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,077 INFO L290 TraceCheckUtils]: 72: Hoare triple {43694#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,077 INFO L290 TraceCheckUtils]: 73: Hoare triple {43694#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {43694#false} is VALID [2022-04-27 15:43:08,077 INFO L290 TraceCheckUtils]: 74: Hoare triple {43694#false} ~skip~0 := 0; {43694#false} is VALID [2022-04-27 15:43:08,077 INFO L290 TraceCheckUtils]: 75: Hoare triple {43694#false} assume !false; {43694#false} is VALID [2022-04-27 15:43:08,078 INFO L290 TraceCheckUtils]: 76: Hoare triple {43694#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,078 INFO L290 TraceCheckUtils]: 77: Hoare triple {43694#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,078 INFO L290 TraceCheckUtils]: 78: Hoare triple {43694#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,078 INFO L290 TraceCheckUtils]: 79: Hoare triple {43694#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,078 INFO L290 TraceCheckUtils]: 80: Hoare triple {43694#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,078 INFO L290 TraceCheckUtils]: 81: Hoare triple {43694#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,078 INFO L290 TraceCheckUtils]: 82: Hoare triple {43694#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,078 INFO L290 TraceCheckUtils]: 83: Hoare triple {43694#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,078 INFO L290 TraceCheckUtils]: 84: Hoare triple {43694#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,078 INFO L290 TraceCheckUtils]: 85: Hoare triple {43694#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,078 INFO L290 TraceCheckUtils]: 86: Hoare triple {43694#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,079 INFO L290 TraceCheckUtils]: 87: Hoare triple {43694#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,079 INFO L290 TraceCheckUtils]: 88: Hoare triple {43694#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,079 INFO L290 TraceCheckUtils]: 89: Hoare triple {43694#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,079 INFO L290 TraceCheckUtils]: 90: Hoare triple {43694#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,079 INFO L290 TraceCheckUtils]: 91: Hoare triple {43694#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,079 INFO L290 TraceCheckUtils]: 92: Hoare triple {43694#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,079 INFO L290 TraceCheckUtils]: 93: Hoare triple {43694#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,079 INFO L290 TraceCheckUtils]: 94: Hoare triple {43694#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,079 INFO L290 TraceCheckUtils]: 95: Hoare triple {43694#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,079 INFO L290 TraceCheckUtils]: 96: Hoare triple {43694#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,079 INFO L290 TraceCheckUtils]: 97: Hoare triple {43694#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,079 INFO L290 TraceCheckUtils]: 98: Hoare triple {43694#false} assume 8448 == #t~mem68;havoc #t~mem68; {43694#false} is VALID [2022-04-27 15:43:08,080 INFO L290 TraceCheckUtils]: 99: Hoare triple {43694#false} assume !(~num1~0 > 0); {43694#false} is VALID [2022-04-27 15:43:08,080 INFO L290 TraceCheckUtils]: 100: Hoare triple {43694#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {43694#false} is VALID [2022-04-27 15:43:08,080 INFO L290 TraceCheckUtils]: 101: Hoare triple {43694#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,080 INFO L290 TraceCheckUtils]: 102: Hoare triple {43694#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {43694#false} is VALID [2022-04-27 15:43:08,080 INFO L290 TraceCheckUtils]: 103: Hoare triple {43694#false} ~skip~0 := 0; {43694#false} is VALID [2022-04-27 15:43:08,080 INFO L290 TraceCheckUtils]: 104: Hoare triple {43694#false} assume !false; {43694#false} is VALID [2022-04-27 15:43:08,080 INFO L290 TraceCheckUtils]: 105: Hoare triple {43694#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,080 INFO L290 TraceCheckUtils]: 106: Hoare triple {43694#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,080 INFO L290 TraceCheckUtils]: 107: Hoare triple {43694#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,080 INFO L290 TraceCheckUtils]: 108: Hoare triple {43694#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,080 INFO L290 TraceCheckUtils]: 109: Hoare triple {43694#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,080 INFO L290 TraceCheckUtils]: 110: Hoare triple {43694#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,081 INFO L290 TraceCheckUtils]: 111: Hoare triple {43694#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,081 INFO L290 TraceCheckUtils]: 112: Hoare triple {43694#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,081 INFO L290 TraceCheckUtils]: 113: Hoare triple {43694#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,081 INFO L290 TraceCheckUtils]: 114: Hoare triple {43694#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,081 INFO L290 TraceCheckUtils]: 115: Hoare triple {43694#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,081 INFO L290 TraceCheckUtils]: 116: Hoare triple {43694#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,081 INFO L290 TraceCheckUtils]: 117: Hoare triple {43694#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,081 INFO L290 TraceCheckUtils]: 118: Hoare triple {43694#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,081 INFO L290 TraceCheckUtils]: 119: Hoare triple {43694#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,081 INFO L290 TraceCheckUtils]: 120: Hoare triple {43694#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,081 INFO L290 TraceCheckUtils]: 121: Hoare triple {43694#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,081 INFO L290 TraceCheckUtils]: 122: Hoare triple {43694#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,081 INFO L290 TraceCheckUtils]: 123: Hoare triple {43694#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,082 INFO L290 TraceCheckUtils]: 124: Hoare triple {43694#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,082 INFO L290 TraceCheckUtils]: 125: Hoare triple {43694#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,082 INFO L290 TraceCheckUtils]: 126: Hoare triple {43694#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,082 INFO L290 TraceCheckUtils]: 127: Hoare triple {43694#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,082 INFO L290 TraceCheckUtils]: 128: Hoare triple {43694#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,082 INFO L290 TraceCheckUtils]: 129: Hoare triple {43694#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,082 INFO L290 TraceCheckUtils]: 130: Hoare triple {43694#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,082 INFO L290 TraceCheckUtils]: 131: Hoare triple {43694#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,082 INFO L290 TraceCheckUtils]: 132: Hoare triple {43694#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,082 INFO L290 TraceCheckUtils]: 133: Hoare triple {43694#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {43694#false} is VALID [2022-04-27 15:43:08,082 INFO L290 TraceCheckUtils]: 134: Hoare triple {43694#false} assume 8640 == #t~mem75;havoc #t~mem75; {43694#false} is VALID [2022-04-27 15:43:08,082 INFO L290 TraceCheckUtils]: 135: Hoare triple {43694#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {43694#false} is VALID [2022-04-27 15:43:08,082 INFO L290 TraceCheckUtils]: 136: Hoare triple {43694#false} assume !(9 == ~blastFlag~0); {43694#false} is VALID [2022-04-27 15:43:08,083 INFO L290 TraceCheckUtils]: 137: Hoare triple {43694#false} assume !(12 == ~blastFlag~0); {43694#false} is VALID [2022-04-27 15:43:08,083 INFO L290 TraceCheckUtils]: 138: Hoare triple {43694#false} assume !false; {43694#false} is VALID [2022-04-27 15:43:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 15:43:08,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:43:08,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544675644] [2022-04-27 15:43:08,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544675644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:43:08,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:43:08,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:43:08,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135518969] [2022-04-27 15:43:08,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:43:08,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-27 15:43:08,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:43:08,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:08,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:08,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:43:08,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:43:08,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:43:08,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:43:08,171 INFO L87 Difference]: Start difference. First operand 389 states and 593 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:12,653 INFO L93 Difference]: Finished difference Result 833 states and 1272 transitions. [2022-04-27 15:43:12,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:43:12,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-27 15:43:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:43:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2022-04-27 15:43:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2022-04-27 15:43:12,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 616 transitions. [2022-04-27 15:43:13,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 616 edges. 616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:13,064 INFO L225 Difference]: With dead ends: 833 [2022-04-27 15:43:13,064 INFO L226 Difference]: Without dead ends: 470 [2022-04-27 15:43:13,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:43:13,065 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 140 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:43:13,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 410 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-27 15:43:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-04-27 15:43:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 389. [2022-04-27 15:43:13,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:43:13,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 470 states. Second operand has 389 states, 384 states have (on average 1.5234375) internal successors, (585), 384 states have internal predecessors, (585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:13,073 INFO L74 IsIncluded]: Start isIncluded. First operand 470 states. Second operand has 389 states, 384 states have (on average 1.5234375) internal successors, (585), 384 states have internal predecessors, (585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:13,074 INFO L87 Difference]: Start difference. First operand 470 states. Second operand has 389 states, 384 states have (on average 1.5234375) internal successors, (585), 384 states have internal predecessors, (585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:13,084 INFO L93 Difference]: Finished difference Result 470 states and 705 transitions. [2022-04-27 15:43:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 705 transitions. [2022-04-27 15:43:13,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:13,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:13,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.5234375) internal successors, (585), 384 states have internal predecessors, (585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 470 states. [2022-04-27 15:43:13,085 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.5234375) internal successors, (585), 384 states have internal predecessors, (585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 470 states. [2022-04-27 15:43:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:13,096 INFO L93 Difference]: Finished difference Result 470 states and 705 transitions. [2022-04-27 15:43:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 705 transitions. [2022-04-27 15:43:13,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:13,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:13,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:43:13,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:43:13,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.5234375) internal successors, (585), 384 states have internal predecessors, (585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 589 transitions. [2022-04-27 15:43:13,105 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 589 transitions. Word has length 139 [2022-04-27 15:43:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:43:13,105 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 589 transitions. [2022-04-27 15:43:13,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 589 transitions. [2022-04-27 15:43:13,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-27 15:43:13,106 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:43:13,106 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-04-27 15:43:13,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-27 15:43:13,107 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:43:13,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:43:13,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1648122513, now seen corresponding path program 1 times [2022-04-27 15:43:13,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:43:13,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335252486] [2022-04-27 15:43:13,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:43:13,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:43:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:13,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:43:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:13,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {46022#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {46015#true} is VALID [2022-04-27 15:43:13,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {46015#true} assume true; {46015#true} is VALID [2022-04-27 15:43:13,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46015#true} {46015#true} #720#return; {46015#true} is VALID [2022-04-27 15:43:13,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {46015#true} call ULTIMATE.init(); {46022#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:43:13,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {46022#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {46015#true} is VALID [2022-04-27 15:43:13,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {46015#true} assume true; {46015#true} is VALID [2022-04-27 15:43:13,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46015#true} {46015#true} #720#return; {46015#true} is VALID [2022-04-27 15:43:13,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {46015#true} call #t~ret161 := main(); {46015#true} is VALID [2022-04-27 15:43:13,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {46015#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {46015#true} is VALID [2022-04-27 15:43:13,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {46015#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,270 INFO L272 TraceCheckUtils]: 7: Hoare triple {46015#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {46015#true} is VALID [2022-04-27 15:43:13,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {46015#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {46015#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {46015#true} is VALID [2022-04-27 15:43:13,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {46015#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {46015#true} is VALID [2022-04-27 15:43:13,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {46015#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {46015#true} is VALID [2022-04-27 15:43:13,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {46015#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {46015#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {46015#true} is VALID [2022-04-27 15:43:13,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {46015#true} assume !false; {46015#true} is VALID [2022-04-27 15:43:13,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {46015#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {46015#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {46015#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {46015#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {46015#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {46015#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {46015#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {46015#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {46015#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {46015#true} assume 8464 == #t~mem55;havoc #t~mem55; {46015#true} is VALID [2022-04-27 15:43:13,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {46015#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {46015#true} is VALID [2022-04-27 15:43:13,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {46015#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {46015#true} is VALID [2022-04-27 15:43:13,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {46015#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {46015#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {46015#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {46015#true} is VALID [2022-04-27 15:43:13,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {46015#true} ~skip~0 := 0; {46015#true} is VALID [2022-04-27 15:43:13,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {46015#true} assume !false; {46015#true} is VALID [2022-04-27 15:43:13,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {46015#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {46015#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {46015#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {46015#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {46015#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,273 INFO L290 TraceCheckUtils]: 37: Hoare triple {46015#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,273 INFO L290 TraceCheckUtils]: 38: Hoare triple {46015#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {46015#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,273 INFO L290 TraceCheckUtils]: 40: Hoare triple {46015#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {46015#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,273 INFO L290 TraceCheckUtils]: 42: Hoare triple {46015#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,273 INFO L290 TraceCheckUtils]: 43: Hoare triple {46015#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {46015#true} assume 8496 == #t~mem58;havoc #t~mem58; {46015#true} is VALID [2022-04-27 15:43:13,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {46015#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {46015#true} is VALID [2022-04-27 15:43:13,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {46015#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {46015#true} is VALID [2022-04-27 15:43:13,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {46015#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {46015#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {46015#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {46015#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {46015#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {46015#true} is VALID [2022-04-27 15:43:13,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {46015#true} ~skip~0 := 0; {46015#true} is VALID [2022-04-27 15:43:13,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {46015#true} assume !false; {46015#true} is VALID [2022-04-27 15:43:13,274 INFO L290 TraceCheckUtils]: 54: Hoare triple {46015#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,274 INFO L290 TraceCheckUtils]: 55: Hoare triple {46015#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,274 INFO L290 TraceCheckUtils]: 56: Hoare triple {46015#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,274 INFO L290 TraceCheckUtils]: 57: Hoare triple {46015#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,274 INFO L290 TraceCheckUtils]: 58: Hoare triple {46015#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,274 INFO L290 TraceCheckUtils]: 59: Hoare triple {46015#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,274 INFO L290 TraceCheckUtils]: 60: Hoare triple {46015#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {46015#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,275 INFO L290 TraceCheckUtils]: 62: Hoare triple {46015#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,275 INFO L290 TraceCheckUtils]: 63: Hoare triple {46015#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,275 INFO L290 TraceCheckUtils]: 64: Hoare triple {46015#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,275 INFO L290 TraceCheckUtils]: 65: Hoare triple {46015#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,275 INFO L290 TraceCheckUtils]: 66: Hoare triple {46015#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,275 INFO L290 TraceCheckUtils]: 67: Hoare triple {46015#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,275 INFO L290 TraceCheckUtils]: 68: Hoare triple {46015#true} assume 8512 == #t~mem60;havoc #t~mem60; {46015#true} is VALID [2022-04-27 15:43:13,275 INFO L290 TraceCheckUtils]: 69: Hoare triple {46015#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {46015#true} is VALID [2022-04-27 15:43:13,275 INFO L290 TraceCheckUtils]: 70: Hoare triple {46015#true} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {46015#true} is VALID [2022-04-27 15:43:13,276 INFO L290 TraceCheckUtils]: 71: Hoare triple {46015#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,277 INFO L290 TraceCheckUtils]: 72: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,277 INFO L290 TraceCheckUtils]: 73: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,278 INFO L290 TraceCheckUtils]: 74: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,278 INFO L290 TraceCheckUtils]: 75: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,278 INFO L290 TraceCheckUtils]: 76: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,279 INFO L290 TraceCheckUtils]: 77: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,279 INFO L290 TraceCheckUtils]: 78: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,279 INFO L290 TraceCheckUtils]: 79: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,280 INFO L290 TraceCheckUtils]: 80: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,280 INFO L290 TraceCheckUtils]: 81: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,281 INFO L290 TraceCheckUtils]: 82: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,281 INFO L290 TraceCheckUtils]: 83: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,281 INFO L290 TraceCheckUtils]: 84: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,282 INFO L290 TraceCheckUtils]: 85: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,282 INFO L290 TraceCheckUtils]: 86: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,283 INFO L290 TraceCheckUtils]: 87: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,283 INFO L290 TraceCheckUtils]: 88: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,283 INFO L290 TraceCheckUtils]: 89: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,284 INFO L290 TraceCheckUtils]: 90: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,284 INFO L290 TraceCheckUtils]: 91: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,285 INFO L290 TraceCheckUtils]: 92: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,285 INFO L290 TraceCheckUtils]: 93: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,285 INFO L290 TraceCheckUtils]: 94: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,286 INFO L290 TraceCheckUtils]: 95: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,286 INFO L290 TraceCheckUtils]: 96: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:13,287 INFO L290 TraceCheckUtils]: 97: Hoare triple {46020#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {46021#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-27 15:43:13,287 INFO L290 TraceCheckUtils]: 98: Hoare triple {46021#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {46016#false} is VALID [2022-04-27 15:43:13,287 INFO L290 TraceCheckUtils]: 99: Hoare triple {46016#false} assume !(~num1~0 > 0); {46016#false} is VALID [2022-04-27 15:43:13,287 INFO L290 TraceCheckUtils]: 100: Hoare triple {46016#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {46016#false} is VALID [2022-04-27 15:43:13,287 INFO L290 TraceCheckUtils]: 101: Hoare triple {46016#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,287 INFO L290 TraceCheckUtils]: 102: Hoare triple {46016#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {46016#false} is VALID [2022-04-27 15:43:13,287 INFO L290 TraceCheckUtils]: 103: Hoare triple {46016#false} ~skip~0 := 0; {46016#false} is VALID [2022-04-27 15:43:13,287 INFO L290 TraceCheckUtils]: 104: Hoare triple {46016#false} assume !false; {46016#false} is VALID [2022-04-27 15:43:13,287 INFO L290 TraceCheckUtils]: 105: Hoare triple {46016#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,288 INFO L290 TraceCheckUtils]: 106: Hoare triple {46016#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,288 INFO L290 TraceCheckUtils]: 107: Hoare triple {46016#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,288 INFO L290 TraceCheckUtils]: 108: Hoare triple {46016#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,288 INFO L290 TraceCheckUtils]: 109: Hoare triple {46016#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,288 INFO L290 TraceCheckUtils]: 110: Hoare triple {46016#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,288 INFO L290 TraceCheckUtils]: 111: Hoare triple {46016#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,288 INFO L290 TraceCheckUtils]: 112: Hoare triple {46016#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,288 INFO L290 TraceCheckUtils]: 113: Hoare triple {46016#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,288 INFO L290 TraceCheckUtils]: 114: Hoare triple {46016#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,288 INFO L290 TraceCheckUtils]: 115: Hoare triple {46016#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,288 INFO L290 TraceCheckUtils]: 116: Hoare triple {46016#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,288 INFO L290 TraceCheckUtils]: 117: Hoare triple {46016#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,289 INFO L290 TraceCheckUtils]: 118: Hoare triple {46016#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,289 INFO L290 TraceCheckUtils]: 119: Hoare triple {46016#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,289 INFO L290 TraceCheckUtils]: 120: Hoare triple {46016#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,289 INFO L290 TraceCheckUtils]: 121: Hoare triple {46016#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,289 INFO L290 TraceCheckUtils]: 122: Hoare triple {46016#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,289 INFO L290 TraceCheckUtils]: 123: Hoare triple {46016#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,289 INFO L290 TraceCheckUtils]: 124: Hoare triple {46016#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,289 INFO L290 TraceCheckUtils]: 125: Hoare triple {46016#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,289 INFO L290 TraceCheckUtils]: 126: Hoare triple {46016#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,289 INFO L290 TraceCheckUtils]: 127: Hoare triple {46016#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,289 INFO L290 TraceCheckUtils]: 128: Hoare triple {46016#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,289 INFO L290 TraceCheckUtils]: 129: Hoare triple {46016#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,290 INFO L290 TraceCheckUtils]: 130: Hoare triple {46016#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,290 INFO L290 TraceCheckUtils]: 131: Hoare triple {46016#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,290 INFO L290 TraceCheckUtils]: 132: Hoare triple {46016#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,290 INFO L290 TraceCheckUtils]: 133: Hoare triple {46016#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {46016#false} is VALID [2022-04-27 15:43:13,290 INFO L290 TraceCheckUtils]: 134: Hoare triple {46016#false} assume 8640 == #t~mem75;havoc #t~mem75; {46016#false} is VALID [2022-04-27 15:43:13,290 INFO L290 TraceCheckUtils]: 135: Hoare triple {46016#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {46016#false} is VALID [2022-04-27 15:43:13,290 INFO L290 TraceCheckUtils]: 136: Hoare triple {46016#false} assume !(9 == ~blastFlag~0); {46016#false} is VALID [2022-04-27 15:43:13,290 INFO L290 TraceCheckUtils]: 137: Hoare triple {46016#false} assume !(12 == ~blastFlag~0); {46016#false} is VALID [2022-04-27 15:43:13,290 INFO L290 TraceCheckUtils]: 138: Hoare triple {46016#false} assume !false; {46016#false} is VALID [2022-04-27 15:43:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 15:43:13,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:43:13,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335252486] [2022-04-27 15:43:13,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335252486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:43:13,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:43:13,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:43:13,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231820715] [2022-04-27 15:43:13,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:43:13,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-27 15:43:13,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:43:13,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:13,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:13,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:43:13,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:43:13,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:43:13,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:43:13,380 INFO L87 Difference]: Start difference. First operand 389 states and 589 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:15,512 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:43:21,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:21,746 INFO L93 Difference]: Finished difference Result 909 states and 1388 transitions. [2022-04-27 15:43:21,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:43:21,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-27 15:43:21,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:43:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2022-04-27 15:43:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2022-04-27 15:43:21,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 611 transitions. [2022-04-27 15:43:22,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 611 edges. 611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:22,168 INFO L225 Difference]: With dead ends: 909 [2022-04-27 15:43:22,168 INFO L226 Difference]: Without dead ends: 546 [2022-04-27 15:43:22,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:43:22,169 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 131 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:43:22,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 408 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 15:43:22,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-04-27 15:43:22,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 453. [2022-04-27 15:43:22,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:43:22,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 546 states. Second operand has 453 states, 448 states have (on average 1.5267857142857142) internal successors, (684), 448 states have internal predecessors, (684), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:22,178 INFO L74 IsIncluded]: Start isIncluded. First operand 546 states. Second operand has 453 states, 448 states have (on average 1.5267857142857142) internal successors, (684), 448 states have internal predecessors, (684), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:22,178 INFO L87 Difference]: Start difference. First operand 546 states. Second operand has 453 states, 448 states have (on average 1.5267857142857142) internal successors, (684), 448 states have internal predecessors, (684), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:22,191 INFO L93 Difference]: Finished difference Result 546 states and 826 transitions. [2022-04-27 15:43:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 826 transitions. [2022-04-27 15:43:22,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:22,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:22,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 453 states, 448 states have (on average 1.5267857142857142) internal successors, (684), 448 states have internal predecessors, (684), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 546 states. [2022-04-27 15:43:22,193 INFO L87 Difference]: Start difference. First operand has 453 states, 448 states have (on average 1.5267857142857142) internal successors, (684), 448 states have internal predecessors, (684), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 546 states. [2022-04-27 15:43:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:22,206 INFO L93 Difference]: Finished difference Result 546 states and 826 transitions. [2022-04-27 15:43:22,206 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 826 transitions. [2022-04-27 15:43:22,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:22,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:22,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:43:22,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:43:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 448 states have (on average 1.5267857142857142) internal successors, (684), 448 states have internal predecessors, (684), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 688 transitions. [2022-04-27 15:43:22,215 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 688 transitions. Word has length 139 [2022-04-27 15:43:22,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:43:22,215 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 688 transitions. [2022-04-27 15:43:22,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 688 transitions. [2022-04-27 15:43:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-27 15:43:22,216 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:43:22,216 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:43:22,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-27 15:43:22,216 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:43:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:43:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1181012203, now seen corresponding path program 1 times [2022-04-27 15:43:22,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:43:22,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293664190] [2022-04-27 15:43:22,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:43:22,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:43:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:22,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:43:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:22,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {48643#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48636#true} is VALID [2022-04-27 15:43:22,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {48636#true} assume true; {48636#true} is VALID [2022-04-27 15:43:22,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48636#true} {48636#true} #720#return; {48636#true} is VALID [2022-04-27 15:43:22,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {48636#true} call ULTIMATE.init(); {48643#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:43:22,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {48643#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48636#true} is VALID [2022-04-27 15:43:22,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {48636#true} assume true; {48636#true} is VALID [2022-04-27 15:43:22,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48636#true} {48636#true} #720#return; {48636#true} is VALID [2022-04-27 15:43:22,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {48636#true} call #t~ret161 := main(); {48636#true} is VALID [2022-04-27 15:43:22,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {48636#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {48636#true} is VALID [2022-04-27 15:43:22,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {48636#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,350 INFO L272 TraceCheckUtils]: 7: Hoare triple {48636#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {48636#true} is VALID [2022-04-27 15:43:22,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {48636#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {48636#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {48636#true} is VALID [2022-04-27 15:43:22,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {48636#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {48636#true} is VALID [2022-04-27 15:43:22,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {48636#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48636#true} is VALID [2022-04-27 15:43:22,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {48636#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {48636#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {48636#true} is VALID [2022-04-27 15:43:22,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {48636#true} assume !false; {48636#true} is VALID [2022-04-27 15:43:22,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {48636#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {48636#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {48636#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {48636#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {48636#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {48636#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {48636#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {48636#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {48636#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {48636#true} assume 8464 == #t~mem55;havoc #t~mem55; {48636#true} is VALID [2022-04-27 15:43:22,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {48636#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {48636#true} is VALID [2022-04-27 15:43:22,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {48636#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48636#true} is VALID [2022-04-27 15:43:22,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {48636#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {48636#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {48636#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48636#true} is VALID [2022-04-27 15:43:22,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {48636#true} ~skip~0 := 0; {48636#true} is VALID [2022-04-27 15:43:22,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {48636#true} assume !false; {48636#true} is VALID [2022-04-27 15:43:22,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {48636#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {48636#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {48636#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {48636#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {48636#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {48636#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {48636#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {48636#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {48636#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {48636#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {48636#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,353 INFO L290 TraceCheckUtils]: 43: Hoare triple {48636#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {48636#true} assume 8496 == #t~mem58;havoc #t~mem58; {48636#true} is VALID [2022-04-27 15:43:22,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {48636#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {48636#true} is VALID [2022-04-27 15:43:22,353 INFO L290 TraceCheckUtils]: 46: Hoare triple {48636#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {48636#true} is VALID [2022-04-27 15:43:22,353 INFO L290 TraceCheckUtils]: 47: Hoare triple {48636#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {48636#true} is VALID [2022-04-27 15:43:22,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {48636#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {48641#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:22,355 INFO L290 TraceCheckUtils]: 49: Hoare triple {48641#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {48641#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:22,355 INFO L290 TraceCheckUtils]: 50: Hoare triple {48641#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {48641#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:22,356 INFO L290 TraceCheckUtils]: 51: Hoare triple {48641#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48641#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:22,356 INFO L290 TraceCheckUtils]: 52: Hoare triple {48641#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {48641#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:22,356 INFO L290 TraceCheckUtils]: 53: Hoare triple {48641#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {48641#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:22,357 INFO L290 TraceCheckUtils]: 54: Hoare triple {48641#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48642#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-27 15:43:22,357 INFO L290 TraceCheckUtils]: 55: Hoare triple {48642#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {48637#false} is VALID [2022-04-27 15:43:22,357 INFO L290 TraceCheckUtils]: 56: Hoare triple {48637#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,357 INFO L290 TraceCheckUtils]: 57: Hoare triple {48637#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,357 INFO L290 TraceCheckUtils]: 58: Hoare triple {48637#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {48637#false} is VALID [2022-04-27 15:43:22,358 INFO L290 TraceCheckUtils]: 59: Hoare triple {48637#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,358 INFO L290 TraceCheckUtils]: 60: Hoare triple {48637#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,358 INFO L290 TraceCheckUtils]: 61: Hoare triple {48637#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {48637#false} is VALID [2022-04-27 15:43:22,358 INFO L290 TraceCheckUtils]: 62: Hoare triple {48637#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,358 INFO L290 TraceCheckUtils]: 63: Hoare triple {48637#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,358 INFO L290 TraceCheckUtils]: 64: Hoare triple {48637#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,358 INFO L290 TraceCheckUtils]: 65: Hoare triple {48637#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48637#false} is VALID [2022-04-27 15:43:22,358 INFO L290 TraceCheckUtils]: 66: Hoare triple {48637#false} ~skip~0 := 0; {48637#false} is VALID [2022-04-27 15:43:22,358 INFO L290 TraceCheckUtils]: 67: Hoare triple {48637#false} assume !false; {48637#false} is VALID [2022-04-27 15:43:22,358 INFO L290 TraceCheckUtils]: 68: Hoare triple {48637#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,359 INFO L290 TraceCheckUtils]: 69: Hoare triple {48637#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,359 INFO L290 TraceCheckUtils]: 70: Hoare triple {48637#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,359 INFO L290 TraceCheckUtils]: 71: Hoare triple {48637#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,359 INFO L290 TraceCheckUtils]: 72: Hoare triple {48637#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,359 INFO L290 TraceCheckUtils]: 73: Hoare triple {48637#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,359 INFO L290 TraceCheckUtils]: 74: Hoare triple {48637#false} assume 8480 == #t~mem52;havoc #t~mem52; {48637#false} is VALID [2022-04-27 15:43:22,359 INFO L290 TraceCheckUtils]: 75: Hoare triple {48637#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {48637#false} is VALID [2022-04-27 15:43:22,359 INFO L290 TraceCheckUtils]: 76: Hoare triple {48637#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,359 INFO L290 TraceCheckUtils]: 77: Hoare triple {48637#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,359 INFO L290 TraceCheckUtils]: 78: Hoare triple {48637#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48637#false} is VALID [2022-04-27 15:43:22,359 INFO L290 TraceCheckUtils]: 79: Hoare triple {48637#false} ~skip~0 := 0; {48637#false} is VALID [2022-04-27 15:43:22,360 INFO L290 TraceCheckUtils]: 80: Hoare triple {48637#false} assume !false; {48637#false} is VALID [2022-04-27 15:43:22,360 INFO L290 TraceCheckUtils]: 81: Hoare triple {48637#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,360 INFO L290 TraceCheckUtils]: 82: Hoare triple {48637#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,360 INFO L290 TraceCheckUtils]: 83: Hoare triple {48637#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,360 INFO L290 TraceCheckUtils]: 84: Hoare triple {48637#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,360 INFO L290 TraceCheckUtils]: 85: Hoare triple {48637#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,360 INFO L290 TraceCheckUtils]: 86: Hoare triple {48637#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,360 INFO L290 TraceCheckUtils]: 87: Hoare triple {48637#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,360 INFO L290 TraceCheckUtils]: 88: Hoare triple {48637#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,360 INFO L290 TraceCheckUtils]: 89: Hoare triple {48637#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,360 INFO L290 TraceCheckUtils]: 90: Hoare triple {48637#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,360 INFO L290 TraceCheckUtils]: 91: Hoare triple {48637#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,361 INFO L290 TraceCheckUtils]: 92: Hoare triple {48637#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,361 INFO L290 TraceCheckUtils]: 93: Hoare triple {48637#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,361 INFO L290 TraceCheckUtils]: 94: Hoare triple {48637#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,361 INFO L290 TraceCheckUtils]: 95: Hoare triple {48637#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,361 INFO L290 TraceCheckUtils]: 96: Hoare triple {48637#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,361 INFO L290 TraceCheckUtils]: 97: Hoare triple {48637#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,361 INFO L290 TraceCheckUtils]: 98: Hoare triple {48637#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,361 INFO L290 TraceCheckUtils]: 99: Hoare triple {48637#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,361 INFO L290 TraceCheckUtils]: 100: Hoare triple {48637#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,361 INFO L290 TraceCheckUtils]: 101: Hoare triple {48637#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,361 INFO L290 TraceCheckUtils]: 102: Hoare triple {48637#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,361 INFO L290 TraceCheckUtils]: 103: Hoare triple {48637#false} assume 8448 == #t~mem68;havoc #t~mem68; {48637#false} is VALID [2022-04-27 15:43:22,362 INFO L290 TraceCheckUtils]: 104: Hoare triple {48637#false} assume !(~num1~0 > 0); {48637#false} is VALID [2022-04-27 15:43:22,362 INFO L290 TraceCheckUtils]: 105: Hoare triple {48637#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {48637#false} is VALID [2022-04-27 15:43:22,362 INFO L290 TraceCheckUtils]: 106: Hoare triple {48637#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,362 INFO L290 TraceCheckUtils]: 107: Hoare triple {48637#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48637#false} is VALID [2022-04-27 15:43:22,362 INFO L290 TraceCheckUtils]: 108: Hoare triple {48637#false} ~skip~0 := 0; {48637#false} is VALID [2022-04-27 15:43:22,362 INFO L290 TraceCheckUtils]: 109: Hoare triple {48637#false} assume !false; {48637#false} is VALID [2022-04-27 15:43:22,362 INFO L290 TraceCheckUtils]: 110: Hoare triple {48637#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,362 INFO L290 TraceCheckUtils]: 111: Hoare triple {48637#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,362 INFO L290 TraceCheckUtils]: 112: Hoare triple {48637#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,362 INFO L290 TraceCheckUtils]: 113: Hoare triple {48637#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,362 INFO L290 TraceCheckUtils]: 114: Hoare triple {48637#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,362 INFO L290 TraceCheckUtils]: 115: Hoare triple {48637#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,363 INFO L290 TraceCheckUtils]: 116: Hoare triple {48637#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,363 INFO L290 TraceCheckUtils]: 117: Hoare triple {48637#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,363 INFO L290 TraceCheckUtils]: 118: Hoare triple {48637#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,363 INFO L290 TraceCheckUtils]: 119: Hoare triple {48637#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,363 INFO L290 TraceCheckUtils]: 120: Hoare triple {48637#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,363 INFO L290 TraceCheckUtils]: 121: Hoare triple {48637#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,363 INFO L290 TraceCheckUtils]: 122: Hoare triple {48637#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,363 INFO L290 TraceCheckUtils]: 123: Hoare triple {48637#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,363 INFO L290 TraceCheckUtils]: 124: Hoare triple {48637#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,363 INFO L290 TraceCheckUtils]: 125: Hoare triple {48637#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,363 INFO L290 TraceCheckUtils]: 126: Hoare triple {48637#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,363 INFO L290 TraceCheckUtils]: 127: Hoare triple {48637#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,364 INFO L290 TraceCheckUtils]: 128: Hoare triple {48637#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,364 INFO L290 TraceCheckUtils]: 129: Hoare triple {48637#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,364 INFO L290 TraceCheckUtils]: 130: Hoare triple {48637#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,364 INFO L290 TraceCheckUtils]: 131: Hoare triple {48637#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,364 INFO L290 TraceCheckUtils]: 132: Hoare triple {48637#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,364 INFO L290 TraceCheckUtils]: 133: Hoare triple {48637#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,364 INFO L290 TraceCheckUtils]: 134: Hoare triple {48637#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,364 INFO L290 TraceCheckUtils]: 135: Hoare triple {48637#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,364 INFO L290 TraceCheckUtils]: 136: Hoare triple {48637#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,364 INFO L290 TraceCheckUtils]: 137: Hoare triple {48637#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,364 INFO L290 TraceCheckUtils]: 138: Hoare triple {48637#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {48637#false} is VALID [2022-04-27 15:43:22,365 INFO L290 TraceCheckUtils]: 139: Hoare triple {48637#false} assume 8640 == #t~mem75;havoc #t~mem75; {48637#false} is VALID [2022-04-27 15:43:22,365 INFO L290 TraceCheckUtils]: 140: Hoare triple {48637#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {48637#false} is VALID [2022-04-27 15:43:22,365 INFO L290 TraceCheckUtils]: 141: Hoare triple {48637#false} assume !(9 == ~blastFlag~0); {48637#false} is VALID [2022-04-27 15:43:22,365 INFO L290 TraceCheckUtils]: 142: Hoare triple {48637#false} assume !(12 == ~blastFlag~0); {48637#false} is VALID [2022-04-27 15:43:22,365 INFO L290 TraceCheckUtils]: 143: Hoare triple {48637#false} assume !false; {48637#false} is VALID [2022-04-27 15:43:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 15:43:22,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:43:22,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293664190] [2022-04-27 15:43:22,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293664190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:43:22,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:43:22,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:43:22,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065716456] [2022-04-27 15:43:22,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:43:22,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 144 [2022-04-27 15:43:22,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:43:22,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:22,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:22,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:43:22,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:43:22,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:43:22,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:43:22,436 INFO L87 Difference]: Start difference. First operand 453 states and 688 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:24,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:43:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:27,242 INFO L93 Difference]: Finished difference Result 951 states and 1450 transitions. [2022-04-27 15:43:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:43:27,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 144 [2022-04-27 15:43:27,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:43:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2022-04-27 15:43:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2022-04-27 15:43:27,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 603 transitions. [2022-04-27 15:43:27,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 603 edges. 603 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:27,638 INFO L225 Difference]: With dead ends: 951 [2022-04-27 15:43:27,638 INFO L226 Difference]: Without dead ends: 524 [2022-04-27 15:43:27,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:43:27,639 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 147 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:43:27,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 416 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 15:43:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-04-27 15:43:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 453. [2022-04-27 15:43:27,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:43:27,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 524 states. Second operand has 453 states, 448 states have (on average 1.5089285714285714) internal successors, (676), 448 states have internal predecessors, (676), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:27,647 INFO L74 IsIncluded]: Start isIncluded. First operand 524 states. Second operand has 453 states, 448 states have (on average 1.5089285714285714) internal successors, (676), 448 states have internal predecessors, (676), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:27,648 INFO L87 Difference]: Start difference. First operand 524 states. Second operand has 453 states, 448 states have (on average 1.5089285714285714) internal successors, (676), 448 states have internal predecessors, (676), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:27,657 INFO L93 Difference]: Finished difference Result 524 states and 784 transitions. [2022-04-27 15:43:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 784 transitions. [2022-04-27 15:43:27,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:27,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:27,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 453 states, 448 states have (on average 1.5089285714285714) internal successors, (676), 448 states have internal predecessors, (676), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 524 states. [2022-04-27 15:43:27,659 INFO L87 Difference]: Start difference. First operand has 453 states, 448 states have (on average 1.5089285714285714) internal successors, (676), 448 states have internal predecessors, (676), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 524 states. [2022-04-27 15:43:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:27,667 INFO L93 Difference]: Finished difference Result 524 states and 784 transitions. [2022-04-27 15:43:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 784 transitions. [2022-04-27 15:43:27,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:27,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:27,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:43:27,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:43:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 448 states have (on average 1.5089285714285714) internal successors, (676), 448 states have internal predecessors, (676), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 680 transitions. [2022-04-27 15:43:27,675 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 680 transitions. Word has length 144 [2022-04-27 15:43:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:43:27,675 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 680 transitions. [2022-04-27 15:43:27,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 680 transitions. [2022-04-27 15:43:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-27 15:43:27,676 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:43:27,676 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:43:27,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-27 15:43:27,676 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:43:27,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:43:27,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1259889173, now seen corresponding path program 1 times [2022-04-27 15:43:27,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:43:27,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028965325] [2022-04-27 15:43:27,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:43:27,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:43:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:27,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:43:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:27,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {51265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {51258#true} is VALID [2022-04-27 15:43:27,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {51258#true} assume true; {51258#true} is VALID [2022-04-27 15:43:27,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51258#true} {51258#true} #720#return; {51258#true} is VALID [2022-04-27 15:43:27,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {51258#true} call ULTIMATE.init(); {51265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:43:27,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {51265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {51258#true} is VALID [2022-04-27 15:43:27,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {51258#true} assume true; {51258#true} is VALID [2022-04-27 15:43:27,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51258#true} {51258#true} #720#return; {51258#true} is VALID [2022-04-27 15:43:27,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {51258#true} call #t~ret161 := main(); {51258#true} is VALID [2022-04-27 15:43:27,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {51258#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {51258#true} is VALID [2022-04-27 15:43:27,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {51258#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,794 INFO L272 TraceCheckUtils]: 7: Hoare triple {51258#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {51258#true} is VALID [2022-04-27 15:43:27,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {51258#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {51258#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {51258#true} is VALID [2022-04-27 15:43:27,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {51258#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {51258#true} is VALID [2022-04-27 15:43:27,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {51258#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {51258#true} is VALID [2022-04-27 15:43:27,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {51258#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {51258#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {51258#true} is VALID [2022-04-27 15:43:27,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {51258#true} assume !false; {51258#true} is VALID [2022-04-27 15:43:27,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {51258#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {51258#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {51258#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {51258#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {51258#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {51258#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {51258#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {51258#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {51258#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {51258#true} assume 8464 == #t~mem55;havoc #t~mem55; {51258#true} is VALID [2022-04-27 15:43:27,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {51258#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {51258#true} is VALID [2022-04-27 15:43:27,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {51258#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {51258#true} is VALID [2022-04-27 15:43:27,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {51258#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {51258#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {51258#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51258#true} is VALID [2022-04-27 15:43:27,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {51258#true} ~skip~0 := 0; {51258#true} is VALID [2022-04-27 15:43:27,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {51258#true} assume !false; {51258#true} is VALID [2022-04-27 15:43:27,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {51258#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {51258#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {51258#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {51258#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {51258#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {51258#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {51258#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {51258#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {51258#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {51258#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {51258#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,797 INFO L290 TraceCheckUtils]: 43: Hoare triple {51258#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,797 INFO L290 TraceCheckUtils]: 44: Hoare triple {51258#true} assume 8496 == #t~mem58;havoc #t~mem58; {51258#true} is VALID [2022-04-27 15:43:27,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {51258#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {51258#true} is VALID [2022-04-27 15:43:27,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {51258#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {51258#true} is VALID [2022-04-27 15:43:27,798 INFO L290 TraceCheckUtils]: 47: Hoare triple {51258#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {51258#true} is VALID [2022-04-27 15:43:27,798 INFO L290 TraceCheckUtils]: 48: Hoare triple {51258#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,799 INFO L290 TraceCheckUtils]: 49: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,800 INFO L290 TraceCheckUtils]: 51: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,800 INFO L290 TraceCheckUtils]: 52: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,801 INFO L290 TraceCheckUtils]: 53: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,801 INFO L290 TraceCheckUtils]: 54: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,801 INFO L290 TraceCheckUtils]: 55: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,802 INFO L290 TraceCheckUtils]: 56: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,802 INFO L290 TraceCheckUtils]: 57: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,803 INFO L290 TraceCheckUtils]: 58: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,803 INFO L290 TraceCheckUtils]: 59: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,803 INFO L290 TraceCheckUtils]: 60: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,805 INFO L290 TraceCheckUtils]: 63: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,805 INFO L290 TraceCheckUtils]: 64: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,805 INFO L290 TraceCheckUtils]: 65: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,806 INFO L290 TraceCheckUtils]: 66: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,806 INFO L290 TraceCheckUtils]: 67: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,806 INFO L290 TraceCheckUtils]: 68: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,807 INFO L290 TraceCheckUtils]: 69: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,807 INFO L290 TraceCheckUtils]: 70: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,808 INFO L290 TraceCheckUtils]: 71: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,808 INFO L290 TraceCheckUtils]: 72: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:27,809 INFO L290 TraceCheckUtils]: 73: Hoare triple {51263#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {51264#(not (= 8560 |ssl3_accept_#t~mem66|))} is VALID [2022-04-27 15:43:27,809 INFO L290 TraceCheckUtils]: 74: Hoare triple {51264#(not (= 8560 |ssl3_accept_#t~mem66|))} assume 8560 == #t~mem66;havoc #t~mem66; {51259#false} is VALID [2022-04-27 15:43:27,809 INFO L290 TraceCheckUtils]: 75: Hoare triple {51259#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {51259#false} is VALID [2022-04-27 15:43:27,809 INFO L290 TraceCheckUtils]: 76: Hoare triple {51259#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,809 INFO L290 TraceCheckUtils]: 77: Hoare triple {51259#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,809 INFO L290 TraceCheckUtils]: 78: Hoare triple {51259#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51259#false} is VALID [2022-04-27 15:43:27,809 INFO L290 TraceCheckUtils]: 79: Hoare triple {51259#false} ~skip~0 := 0; {51259#false} is VALID [2022-04-27 15:43:27,809 INFO L290 TraceCheckUtils]: 80: Hoare triple {51259#false} assume !false; {51259#false} is VALID [2022-04-27 15:43:27,809 INFO L290 TraceCheckUtils]: 81: Hoare triple {51259#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,810 INFO L290 TraceCheckUtils]: 82: Hoare triple {51259#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,810 INFO L290 TraceCheckUtils]: 83: Hoare triple {51259#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,810 INFO L290 TraceCheckUtils]: 84: Hoare triple {51259#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,810 INFO L290 TraceCheckUtils]: 85: Hoare triple {51259#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,810 INFO L290 TraceCheckUtils]: 86: Hoare triple {51259#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,810 INFO L290 TraceCheckUtils]: 87: Hoare triple {51259#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,810 INFO L290 TraceCheckUtils]: 88: Hoare triple {51259#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,810 INFO L290 TraceCheckUtils]: 89: Hoare triple {51259#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,810 INFO L290 TraceCheckUtils]: 90: Hoare triple {51259#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,810 INFO L290 TraceCheckUtils]: 91: Hoare triple {51259#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,810 INFO L290 TraceCheckUtils]: 92: Hoare triple {51259#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,811 INFO L290 TraceCheckUtils]: 93: Hoare triple {51259#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,811 INFO L290 TraceCheckUtils]: 94: Hoare triple {51259#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,811 INFO L290 TraceCheckUtils]: 95: Hoare triple {51259#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,811 INFO L290 TraceCheckUtils]: 96: Hoare triple {51259#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,811 INFO L290 TraceCheckUtils]: 97: Hoare triple {51259#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,811 INFO L290 TraceCheckUtils]: 98: Hoare triple {51259#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,811 INFO L290 TraceCheckUtils]: 99: Hoare triple {51259#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,811 INFO L290 TraceCheckUtils]: 100: Hoare triple {51259#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,811 INFO L290 TraceCheckUtils]: 101: Hoare triple {51259#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,811 INFO L290 TraceCheckUtils]: 102: Hoare triple {51259#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,811 INFO L290 TraceCheckUtils]: 103: Hoare triple {51259#false} assume 8448 == #t~mem68;havoc #t~mem68; {51259#false} is VALID [2022-04-27 15:43:27,811 INFO L290 TraceCheckUtils]: 104: Hoare triple {51259#false} assume !(~num1~0 > 0); {51259#false} is VALID [2022-04-27 15:43:27,811 INFO L290 TraceCheckUtils]: 105: Hoare triple {51259#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {51259#false} is VALID [2022-04-27 15:43:27,812 INFO L290 TraceCheckUtils]: 106: Hoare triple {51259#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,812 INFO L290 TraceCheckUtils]: 107: Hoare triple {51259#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51259#false} is VALID [2022-04-27 15:43:27,812 INFO L290 TraceCheckUtils]: 108: Hoare triple {51259#false} ~skip~0 := 0; {51259#false} is VALID [2022-04-27 15:43:27,812 INFO L290 TraceCheckUtils]: 109: Hoare triple {51259#false} assume !false; {51259#false} is VALID [2022-04-27 15:43:27,812 INFO L290 TraceCheckUtils]: 110: Hoare triple {51259#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,812 INFO L290 TraceCheckUtils]: 111: Hoare triple {51259#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,812 INFO L290 TraceCheckUtils]: 112: Hoare triple {51259#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,812 INFO L290 TraceCheckUtils]: 113: Hoare triple {51259#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,812 INFO L290 TraceCheckUtils]: 114: Hoare triple {51259#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,812 INFO L290 TraceCheckUtils]: 115: Hoare triple {51259#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,812 INFO L290 TraceCheckUtils]: 116: Hoare triple {51259#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,812 INFO L290 TraceCheckUtils]: 117: Hoare triple {51259#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,813 INFO L290 TraceCheckUtils]: 118: Hoare triple {51259#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,813 INFO L290 TraceCheckUtils]: 119: Hoare triple {51259#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,813 INFO L290 TraceCheckUtils]: 120: Hoare triple {51259#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,813 INFO L290 TraceCheckUtils]: 121: Hoare triple {51259#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,813 INFO L290 TraceCheckUtils]: 122: Hoare triple {51259#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,813 INFO L290 TraceCheckUtils]: 123: Hoare triple {51259#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,813 INFO L290 TraceCheckUtils]: 124: Hoare triple {51259#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,813 INFO L290 TraceCheckUtils]: 125: Hoare triple {51259#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,813 INFO L290 TraceCheckUtils]: 126: Hoare triple {51259#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,813 INFO L290 TraceCheckUtils]: 127: Hoare triple {51259#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,813 INFO L290 TraceCheckUtils]: 128: Hoare triple {51259#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,813 INFO L290 TraceCheckUtils]: 129: Hoare triple {51259#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,813 INFO L290 TraceCheckUtils]: 130: Hoare triple {51259#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,814 INFO L290 TraceCheckUtils]: 131: Hoare triple {51259#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,814 INFO L290 TraceCheckUtils]: 132: Hoare triple {51259#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,814 INFO L290 TraceCheckUtils]: 133: Hoare triple {51259#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,814 INFO L290 TraceCheckUtils]: 134: Hoare triple {51259#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,814 INFO L290 TraceCheckUtils]: 135: Hoare triple {51259#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,814 INFO L290 TraceCheckUtils]: 136: Hoare triple {51259#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,814 INFO L290 TraceCheckUtils]: 137: Hoare triple {51259#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,814 INFO L290 TraceCheckUtils]: 138: Hoare triple {51259#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {51259#false} is VALID [2022-04-27 15:43:27,814 INFO L290 TraceCheckUtils]: 139: Hoare triple {51259#false} assume 8640 == #t~mem75;havoc #t~mem75; {51259#false} is VALID [2022-04-27 15:43:27,814 INFO L290 TraceCheckUtils]: 140: Hoare triple {51259#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {51259#false} is VALID [2022-04-27 15:43:27,814 INFO L290 TraceCheckUtils]: 141: Hoare triple {51259#false} assume !(9 == ~blastFlag~0); {51259#false} is VALID [2022-04-27 15:43:27,814 INFO L290 TraceCheckUtils]: 142: Hoare triple {51259#false} assume !(12 == ~blastFlag~0); {51259#false} is VALID [2022-04-27 15:43:27,815 INFO L290 TraceCheckUtils]: 143: Hoare triple {51259#false} assume !false; {51259#false} is VALID [2022-04-27 15:43:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 15:43:27,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:43:27,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028965325] [2022-04-27 15:43:27,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028965325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:43:27,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:43:27,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:43:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614529101] [2022-04-27 15:43:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:43:27,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 144 [2022-04-27 15:43:27,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:43:27,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:27,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:27,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:43:27,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:43:27,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:43:27,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:43:27,901 INFO L87 Difference]: Start difference. First operand 453 states and 680 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:31,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:43:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:33,856 INFO L93 Difference]: Finished difference Result 991 states and 1496 transitions. [2022-04-27 15:43:33,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:43:33,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 144 [2022-04-27 15:43:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:43:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-04-27 15:43:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-04-27 15:43:33,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 602 transitions. [2022-04-27 15:43:34,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:34,244 INFO L225 Difference]: With dead ends: 991 [2022-04-27 15:43:34,244 INFO L226 Difference]: Without dead ends: 564 [2022-04-27 15:43:34,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:43:34,245 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 127 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:43:34,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 416 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 15:43:34,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-04-27 15:43:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 483. [2022-04-27 15:43:34,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:43:34,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 564 states. Second operand has 483 states, 478 states have (on average 1.497907949790795) internal successors, (716), 478 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:34,254 INFO L74 IsIncluded]: Start isIncluded. First operand 564 states. Second operand has 483 states, 478 states have (on average 1.497907949790795) internal successors, (716), 478 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:34,254 INFO L87 Difference]: Start difference. First operand 564 states. Second operand has 483 states, 478 states have (on average 1.497907949790795) internal successors, (716), 478 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:34,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:34,268 INFO L93 Difference]: Finished difference Result 564 states and 840 transitions. [2022-04-27 15:43:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 840 transitions. [2022-04-27 15:43:34,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:34,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:34,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 483 states, 478 states have (on average 1.497907949790795) internal successors, (716), 478 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 564 states. [2022-04-27 15:43:34,270 INFO L87 Difference]: Start difference. First operand has 483 states, 478 states have (on average 1.497907949790795) internal successors, (716), 478 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 564 states. [2022-04-27 15:43:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:34,283 INFO L93 Difference]: Finished difference Result 564 states and 840 transitions. [2022-04-27 15:43:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 840 transitions. [2022-04-27 15:43:34,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:34,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:34,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:43:34,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:43:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 478 states have (on average 1.497907949790795) internal successors, (716), 478 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 720 transitions. [2022-04-27 15:43:34,296 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 720 transitions. Word has length 144 [2022-04-27 15:43:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:43:34,296 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 720 transitions. [2022-04-27 15:43:34,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 720 transitions. [2022-04-27 15:43:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-27 15:43:34,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:43:34,297 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-27 15:43:34,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-27 15:43:34,297 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:43:34,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:43:34,298 INFO L85 PathProgramCache]: Analyzing trace with hash -65949138, now seen corresponding path program 1 times [2022-04-27 15:43:34,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:43:34,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933384962] [2022-04-27 15:43:34,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:43:34,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:43:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:34,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:43:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:34,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {54041#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {54034#true} is VALID [2022-04-27 15:43:34,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {54034#true} assume true; {54034#true} is VALID [2022-04-27 15:43:34,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54034#true} {54034#true} #720#return; {54034#true} is VALID [2022-04-27 15:43:34,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {54034#true} call ULTIMATE.init(); {54041#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:43:34,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {54041#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {54034#true} is VALID [2022-04-27 15:43:34,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {54034#true} assume true; {54034#true} is VALID [2022-04-27 15:43:34,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54034#true} {54034#true} #720#return; {54034#true} is VALID [2022-04-27 15:43:34,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {54034#true} call #t~ret161 := main(); {54034#true} is VALID [2022-04-27 15:43:34,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {54034#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {54034#true} is VALID [2022-04-27 15:43:34,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {54034#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,434 INFO L272 TraceCheckUtils]: 7: Hoare triple {54034#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {54034#true} is VALID [2022-04-27 15:43:34,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {54034#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {54034#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {54034#true} is VALID [2022-04-27 15:43:34,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {54034#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {54034#true} is VALID [2022-04-27 15:43:34,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {54034#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {54034#true} is VALID [2022-04-27 15:43:34,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {54034#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {54034#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {54034#true} is VALID [2022-04-27 15:43:34,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {54034#true} assume !false; {54034#true} is VALID [2022-04-27 15:43:34,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {54034#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {54034#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {54034#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {54034#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {54034#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {54034#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {54034#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {54034#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {54034#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {54034#true} assume 8464 == #t~mem55;havoc #t~mem55; {54034#true} is VALID [2022-04-27 15:43:34,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {54034#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {54034#true} is VALID [2022-04-27 15:43:34,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {54034#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {54034#true} is VALID [2022-04-27 15:43:34,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {54034#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {54034#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {54034#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54034#true} is VALID [2022-04-27 15:43:34,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {54034#true} ~skip~0 := 0; {54034#true} is VALID [2022-04-27 15:43:34,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {54034#true} assume !false; {54034#true} is VALID [2022-04-27 15:43:34,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {54034#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {54034#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {54034#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {54034#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {54034#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {54034#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {54034#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {54034#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {54034#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {54034#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,437 INFO L290 TraceCheckUtils]: 42: Hoare triple {54034#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,437 INFO L290 TraceCheckUtils]: 43: Hoare triple {54034#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,437 INFO L290 TraceCheckUtils]: 44: Hoare triple {54034#true} assume 8496 == #t~mem58;havoc #t~mem58; {54034#true} is VALID [2022-04-27 15:43:34,437 INFO L290 TraceCheckUtils]: 45: Hoare triple {54034#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {54034#true} is VALID [2022-04-27 15:43:34,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {54034#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {54034#true} is VALID [2022-04-27 15:43:34,438 INFO L290 TraceCheckUtils]: 47: Hoare triple {54034#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {54034#true} is VALID [2022-04-27 15:43:34,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {54034#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,439 INFO L290 TraceCheckUtils]: 49: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,440 INFO L290 TraceCheckUtils]: 50: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,440 INFO L290 TraceCheckUtils]: 52: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,441 INFO L290 TraceCheckUtils]: 54: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,441 INFO L290 TraceCheckUtils]: 55: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,442 INFO L290 TraceCheckUtils]: 56: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,442 INFO L290 TraceCheckUtils]: 57: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,443 INFO L290 TraceCheckUtils]: 58: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,443 INFO L290 TraceCheckUtils]: 59: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,443 INFO L290 TraceCheckUtils]: 60: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,444 INFO L290 TraceCheckUtils]: 61: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,444 INFO L290 TraceCheckUtils]: 62: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,445 INFO L290 TraceCheckUtils]: 63: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,445 INFO L290 TraceCheckUtils]: 64: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,445 INFO L290 TraceCheckUtils]: 65: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,446 INFO L290 TraceCheckUtils]: 66: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,446 INFO L290 TraceCheckUtils]: 67: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,446 INFO L290 TraceCheckUtils]: 68: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,447 INFO L290 TraceCheckUtils]: 69: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,447 INFO L290 TraceCheckUtils]: 70: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,448 INFO L290 TraceCheckUtils]: 71: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,448 INFO L290 TraceCheckUtils]: 72: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,448 INFO L290 TraceCheckUtils]: 73: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:34,449 INFO L290 TraceCheckUtils]: 74: Hoare triple {54039#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {54040#(= |ssl3_accept_#t~mem67| 8656)} is VALID [2022-04-27 15:43:34,449 INFO L290 TraceCheckUtils]: 75: Hoare triple {54040#(= |ssl3_accept_#t~mem67| 8656)} assume 8561 == #t~mem67;havoc #t~mem67; {54035#false} is VALID [2022-04-27 15:43:34,449 INFO L290 TraceCheckUtils]: 76: Hoare triple {54035#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {54035#false} is VALID [2022-04-27 15:43:34,449 INFO L290 TraceCheckUtils]: 77: Hoare triple {54035#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,449 INFO L290 TraceCheckUtils]: 78: Hoare triple {54035#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,449 INFO L290 TraceCheckUtils]: 79: Hoare triple {54035#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54035#false} is VALID [2022-04-27 15:43:34,449 INFO L290 TraceCheckUtils]: 80: Hoare triple {54035#false} ~skip~0 := 0; {54035#false} is VALID [2022-04-27 15:43:34,450 INFO L290 TraceCheckUtils]: 81: Hoare triple {54035#false} assume !false; {54035#false} is VALID [2022-04-27 15:43:34,450 INFO L290 TraceCheckUtils]: 82: Hoare triple {54035#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,450 INFO L290 TraceCheckUtils]: 83: Hoare triple {54035#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,450 INFO L290 TraceCheckUtils]: 84: Hoare triple {54035#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,450 INFO L290 TraceCheckUtils]: 85: Hoare triple {54035#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,450 INFO L290 TraceCheckUtils]: 86: Hoare triple {54035#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,450 INFO L290 TraceCheckUtils]: 87: Hoare triple {54035#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,450 INFO L290 TraceCheckUtils]: 88: Hoare triple {54035#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,450 INFO L290 TraceCheckUtils]: 89: Hoare triple {54035#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,450 INFO L290 TraceCheckUtils]: 90: Hoare triple {54035#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,450 INFO L290 TraceCheckUtils]: 91: Hoare triple {54035#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,450 INFO L290 TraceCheckUtils]: 92: Hoare triple {54035#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,451 INFO L290 TraceCheckUtils]: 93: Hoare triple {54035#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,451 INFO L290 TraceCheckUtils]: 94: Hoare triple {54035#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,451 INFO L290 TraceCheckUtils]: 95: Hoare triple {54035#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,451 INFO L290 TraceCheckUtils]: 96: Hoare triple {54035#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,451 INFO L290 TraceCheckUtils]: 97: Hoare triple {54035#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,451 INFO L290 TraceCheckUtils]: 98: Hoare triple {54035#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,451 INFO L290 TraceCheckUtils]: 99: Hoare triple {54035#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,451 INFO L290 TraceCheckUtils]: 100: Hoare triple {54035#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,451 INFO L290 TraceCheckUtils]: 101: Hoare triple {54035#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,451 INFO L290 TraceCheckUtils]: 102: Hoare triple {54035#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,451 INFO L290 TraceCheckUtils]: 103: Hoare triple {54035#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,451 INFO L290 TraceCheckUtils]: 104: Hoare triple {54035#false} assume 8448 == #t~mem68;havoc #t~mem68; {54035#false} is VALID [2022-04-27 15:43:34,452 INFO L290 TraceCheckUtils]: 105: Hoare triple {54035#false} assume !(~num1~0 > 0); {54035#false} is VALID [2022-04-27 15:43:34,452 INFO L290 TraceCheckUtils]: 106: Hoare triple {54035#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {54035#false} is VALID [2022-04-27 15:43:34,452 INFO L290 TraceCheckUtils]: 107: Hoare triple {54035#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,452 INFO L290 TraceCheckUtils]: 108: Hoare triple {54035#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54035#false} is VALID [2022-04-27 15:43:34,452 INFO L290 TraceCheckUtils]: 109: Hoare triple {54035#false} ~skip~0 := 0; {54035#false} is VALID [2022-04-27 15:43:34,452 INFO L290 TraceCheckUtils]: 110: Hoare triple {54035#false} assume !false; {54035#false} is VALID [2022-04-27 15:43:34,452 INFO L290 TraceCheckUtils]: 111: Hoare triple {54035#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,452 INFO L290 TraceCheckUtils]: 112: Hoare triple {54035#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,452 INFO L290 TraceCheckUtils]: 113: Hoare triple {54035#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,452 INFO L290 TraceCheckUtils]: 114: Hoare triple {54035#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,452 INFO L290 TraceCheckUtils]: 115: Hoare triple {54035#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,452 INFO L290 TraceCheckUtils]: 116: Hoare triple {54035#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,452 INFO L290 TraceCheckUtils]: 117: Hoare triple {54035#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,453 INFO L290 TraceCheckUtils]: 118: Hoare triple {54035#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,453 INFO L290 TraceCheckUtils]: 119: Hoare triple {54035#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,453 INFO L290 TraceCheckUtils]: 120: Hoare triple {54035#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,453 INFO L290 TraceCheckUtils]: 121: Hoare triple {54035#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,453 INFO L290 TraceCheckUtils]: 122: Hoare triple {54035#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,453 INFO L290 TraceCheckUtils]: 123: Hoare triple {54035#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,453 INFO L290 TraceCheckUtils]: 124: Hoare triple {54035#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,453 INFO L290 TraceCheckUtils]: 125: Hoare triple {54035#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,453 INFO L290 TraceCheckUtils]: 126: Hoare triple {54035#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,453 INFO L290 TraceCheckUtils]: 127: Hoare triple {54035#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,453 INFO L290 TraceCheckUtils]: 128: Hoare triple {54035#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,453 INFO L290 TraceCheckUtils]: 129: Hoare triple {54035#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,453 INFO L290 TraceCheckUtils]: 130: Hoare triple {54035#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,454 INFO L290 TraceCheckUtils]: 131: Hoare triple {54035#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,454 INFO L290 TraceCheckUtils]: 132: Hoare triple {54035#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,454 INFO L290 TraceCheckUtils]: 133: Hoare triple {54035#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,454 INFO L290 TraceCheckUtils]: 134: Hoare triple {54035#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,454 INFO L290 TraceCheckUtils]: 135: Hoare triple {54035#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,454 INFO L290 TraceCheckUtils]: 136: Hoare triple {54035#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,454 INFO L290 TraceCheckUtils]: 137: Hoare triple {54035#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,454 INFO L290 TraceCheckUtils]: 138: Hoare triple {54035#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,454 INFO L290 TraceCheckUtils]: 139: Hoare triple {54035#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {54035#false} is VALID [2022-04-27 15:43:34,454 INFO L290 TraceCheckUtils]: 140: Hoare triple {54035#false} assume 8640 == #t~mem75;havoc #t~mem75; {54035#false} is VALID [2022-04-27 15:43:34,454 INFO L290 TraceCheckUtils]: 141: Hoare triple {54035#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {54035#false} is VALID [2022-04-27 15:43:34,454 INFO L290 TraceCheckUtils]: 142: Hoare triple {54035#false} assume !(9 == ~blastFlag~0); {54035#false} is VALID [2022-04-27 15:43:34,454 INFO L290 TraceCheckUtils]: 143: Hoare triple {54035#false} assume !(12 == ~blastFlag~0); {54035#false} is VALID [2022-04-27 15:43:34,455 INFO L290 TraceCheckUtils]: 144: Hoare triple {54035#false} assume !false; {54035#false} is VALID [2022-04-27 15:43:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 15:43:34,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:43:34,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933384962] [2022-04-27 15:43:34,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933384962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:43:34,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:43:34,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:43:34,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989317903] [2022-04-27 15:43:34,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:43:34,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-27 15:43:34,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:43:34,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:34,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:34,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:43:34,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:43:34,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:43:34,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:43:34,536 INFO L87 Difference]: Start difference. First operand 483 states and 720 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:39,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:43:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:41,215 INFO L93 Difference]: Finished difference Result 972 states and 1457 transitions. [2022-04-27 15:43:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:43:41,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-27 15:43:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:43:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2022-04-27 15:43:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2022-04-27 15:43:41,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 541 transitions. [2022-04-27 15:43:41,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:41,577 INFO L225 Difference]: With dead ends: 972 [2022-04-27 15:43:41,577 INFO L226 Difference]: Without dead ends: 515 [2022-04-27 15:43:41,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:43:41,578 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 66 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:43:41,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 545 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-27 15:43:41,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-27 15:43:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 483. [2022-04-27 15:43:41,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:43:41,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:41,587 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:41,587 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:41,599 INFO L93 Difference]: Finished difference Result 515 states and 766 transitions. [2022-04-27 15:43:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 766 transitions. [2022-04-27 15:43:41,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:41,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:41,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-27 15:43:41,600 INFO L87 Difference]: Start difference. First operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-27 15:43:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:41,610 INFO L93 Difference]: Finished difference Result 515 states and 766 transitions. [2022-04-27 15:43:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 766 transitions. [2022-04-27 15:43:41,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:41,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:41,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:43:41,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:43:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 719 transitions. [2022-04-27 15:43:41,618 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 719 transitions. Word has length 145 [2022-04-27 15:43:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:43:41,618 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 719 transitions. [2022-04-27 15:43:41,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 719 transitions. [2022-04-27 15:43:41,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-27 15:43:41,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:43:41,619 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1] [2022-04-27 15:43:41,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-27 15:43:41,620 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:43:41,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:43:41,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1145366633, now seen corresponding path program 1 times [2022-04-27 15:43:41,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:43:41,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944094008] [2022-04-27 15:43:41,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:43:41,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:43:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:41,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:43:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:41,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {56693#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {56687#true} is VALID [2022-04-27 15:43:41,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {56687#true} assume true; {56687#true} is VALID [2022-04-27 15:43:41,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56687#true} {56687#true} #720#return; {56687#true} is VALID [2022-04-27 15:43:41,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {56687#true} call ULTIMATE.init(); {56693#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:43:41,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {56693#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {56687#true} is VALID [2022-04-27 15:43:41,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {56687#true} assume true; {56687#true} is VALID [2022-04-27 15:43:41,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56687#true} {56687#true} #720#return; {56687#true} is VALID [2022-04-27 15:43:41,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {56687#true} call #t~ret161 := main(); {56687#true} is VALID [2022-04-27 15:43:41,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {56687#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {56687#true} is VALID [2022-04-27 15:43:41,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {56687#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,735 INFO L272 TraceCheckUtils]: 7: Hoare triple {56687#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {56687#true} is VALID [2022-04-27 15:43:41,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {56687#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {56687#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {56687#true} is VALID [2022-04-27 15:43:41,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {56687#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {56687#true} is VALID [2022-04-27 15:43:41,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {56687#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {56687#true} is VALID [2022-04-27 15:43:41,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {56687#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {56687#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {56687#true} is VALID [2022-04-27 15:43:41,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {56687#true} assume !false; {56687#true} is VALID [2022-04-27 15:43:41,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {56687#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {56687#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {56687#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {56687#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {56687#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {56687#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {56687#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {56687#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {56687#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {56687#true} assume 8464 == #t~mem55;havoc #t~mem55; {56687#true} is VALID [2022-04-27 15:43:41,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {56687#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {56687#true} is VALID [2022-04-27 15:43:41,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {56687#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {56687#true} is VALID [2022-04-27 15:43:41,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {56687#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {56687#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {56687#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56687#true} is VALID [2022-04-27 15:43:41,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {56687#true} ~skip~0 := 0; {56687#true} is VALID [2022-04-27 15:43:41,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {56687#true} assume !false; {56687#true} is VALID [2022-04-27 15:43:41,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {56687#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {56687#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {56687#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {56687#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {56687#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {56687#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {56687#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {56687#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {56687#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {56687#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {56687#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {56687#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {56687#true} is VALID [2022-04-27 15:43:41,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {56687#true} assume 8496 == #t~mem58;havoc #t~mem58; {56687#true} is VALID [2022-04-27 15:43:41,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {56687#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {56687#true} is VALID [2022-04-27 15:43:41,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {56687#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,739 INFO L290 TraceCheckUtils]: 50: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,739 INFO L290 TraceCheckUtils]: 51: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,740 INFO L290 TraceCheckUtils]: 54: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,741 INFO L290 TraceCheckUtils]: 55: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,741 INFO L290 TraceCheckUtils]: 56: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,741 INFO L290 TraceCheckUtils]: 57: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,742 INFO L290 TraceCheckUtils]: 59: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,742 INFO L290 TraceCheckUtils]: 60: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,742 INFO L290 TraceCheckUtils]: 61: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,743 INFO L290 TraceCheckUtils]: 63: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,743 INFO L290 TraceCheckUtils]: 64: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,744 INFO L290 TraceCheckUtils]: 65: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,744 INFO L290 TraceCheckUtils]: 66: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,744 INFO L290 TraceCheckUtils]: 67: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,744 INFO L290 TraceCheckUtils]: 68: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,745 INFO L290 TraceCheckUtils]: 69: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,745 INFO L290 TraceCheckUtils]: 70: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,745 INFO L290 TraceCheckUtils]: 71: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,746 INFO L290 TraceCheckUtils]: 72: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,746 INFO L290 TraceCheckUtils]: 73: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,746 INFO L290 TraceCheckUtils]: 74: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,746 INFO L290 TraceCheckUtils]: 75: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,747 INFO L290 TraceCheckUtils]: 76: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,747 INFO L290 TraceCheckUtils]: 77: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,747 INFO L290 TraceCheckUtils]: 78: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,748 INFO L290 TraceCheckUtils]: 79: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,748 INFO L290 TraceCheckUtils]: 80: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,748 INFO L290 TraceCheckUtils]: 81: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,748 INFO L290 TraceCheckUtils]: 82: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,749 INFO L290 TraceCheckUtils]: 83: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,749 INFO L290 TraceCheckUtils]: 84: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,749 INFO L290 TraceCheckUtils]: 85: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,750 INFO L290 TraceCheckUtils]: 86: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,750 INFO L290 TraceCheckUtils]: 87: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,750 INFO L290 TraceCheckUtils]: 88: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,750 INFO L290 TraceCheckUtils]: 89: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,751 INFO L290 TraceCheckUtils]: 90: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,751 INFO L290 TraceCheckUtils]: 91: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,751 INFO L290 TraceCheckUtils]: 92: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,752 INFO L290 TraceCheckUtils]: 93: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,752 INFO L290 TraceCheckUtils]: 94: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,752 INFO L290 TraceCheckUtils]: 95: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,752 INFO L290 TraceCheckUtils]: 96: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,753 INFO L290 TraceCheckUtils]: 97: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,753 INFO L290 TraceCheckUtils]: 98: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,753 INFO L290 TraceCheckUtils]: 99: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,754 INFO L290 TraceCheckUtils]: 100: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,754 INFO L290 TraceCheckUtils]: 101: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,754 INFO L290 TraceCheckUtils]: 102: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,754 INFO L290 TraceCheckUtils]: 103: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,755 INFO L290 TraceCheckUtils]: 104: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume 8609 == #t~mem74;havoc #t~mem74; {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,755 INFO L290 TraceCheckUtils]: 105: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {56692#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:43:41,755 INFO L290 TraceCheckUtils]: 106: Hoare triple {56692#(= 2 ssl3_accept_~blastFlag~0)} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {56688#false} is VALID [2022-04-27 15:43:41,755 INFO L290 TraceCheckUtils]: 107: Hoare triple {56688#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,756 INFO L290 TraceCheckUtils]: 108: Hoare triple {56688#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,756 INFO L290 TraceCheckUtils]: 109: Hoare triple {56688#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56688#false} is VALID [2022-04-27 15:43:41,756 INFO L290 TraceCheckUtils]: 110: Hoare triple {56688#false} ~skip~0 := 0; {56688#false} is VALID [2022-04-27 15:43:41,756 INFO L290 TraceCheckUtils]: 111: Hoare triple {56688#false} assume !false; {56688#false} is VALID [2022-04-27 15:43:41,756 INFO L290 TraceCheckUtils]: 112: Hoare triple {56688#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,756 INFO L290 TraceCheckUtils]: 113: Hoare triple {56688#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,756 INFO L290 TraceCheckUtils]: 114: Hoare triple {56688#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,756 INFO L290 TraceCheckUtils]: 115: Hoare triple {56688#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,756 INFO L290 TraceCheckUtils]: 116: Hoare triple {56688#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,756 INFO L290 TraceCheckUtils]: 117: Hoare triple {56688#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,756 INFO L290 TraceCheckUtils]: 118: Hoare triple {56688#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,756 INFO L290 TraceCheckUtils]: 119: Hoare triple {56688#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,756 INFO L290 TraceCheckUtils]: 120: Hoare triple {56688#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,757 INFO L290 TraceCheckUtils]: 121: Hoare triple {56688#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,757 INFO L290 TraceCheckUtils]: 122: Hoare triple {56688#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,757 INFO L290 TraceCheckUtils]: 123: Hoare triple {56688#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,757 INFO L290 TraceCheckUtils]: 124: Hoare triple {56688#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,757 INFO L290 TraceCheckUtils]: 125: Hoare triple {56688#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,757 INFO L290 TraceCheckUtils]: 126: Hoare triple {56688#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,757 INFO L290 TraceCheckUtils]: 127: Hoare triple {56688#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,757 INFO L290 TraceCheckUtils]: 128: Hoare triple {56688#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,757 INFO L290 TraceCheckUtils]: 129: Hoare triple {56688#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,757 INFO L290 TraceCheckUtils]: 130: Hoare triple {56688#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,757 INFO L290 TraceCheckUtils]: 131: Hoare triple {56688#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,757 INFO L290 TraceCheckUtils]: 132: Hoare triple {56688#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,757 INFO L290 TraceCheckUtils]: 133: Hoare triple {56688#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,757 INFO L290 TraceCheckUtils]: 134: Hoare triple {56688#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,758 INFO L290 TraceCheckUtils]: 135: Hoare triple {56688#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,758 INFO L290 TraceCheckUtils]: 136: Hoare triple {56688#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,758 INFO L290 TraceCheckUtils]: 137: Hoare triple {56688#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,758 INFO L290 TraceCheckUtils]: 138: Hoare triple {56688#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,758 INFO L290 TraceCheckUtils]: 139: Hoare triple {56688#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,758 INFO L290 TraceCheckUtils]: 140: Hoare triple {56688#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {56688#false} is VALID [2022-04-27 15:43:41,758 INFO L290 TraceCheckUtils]: 141: Hoare triple {56688#false} assume 8640 == #t~mem75;havoc #t~mem75; {56688#false} is VALID [2022-04-27 15:43:41,758 INFO L290 TraceCheckUtils]: 142: Hoare triple {56688#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {56688#false} is VALID [2022-04-27 15:43:41,758 INFO L290 TraceCheckUtils]: 143: Hoare triple {56688#false} assume !(9 == ~blastFlag~0); {56688#false} is VALID [2022-04-27 15:43:41,758 INFO L290 TraceCheckUtils]: 144: Hoare triple {56688#false} assume !(12 == ~blastFlag~0); {56688#false} is VALID [2022-04-27 15:43:41,758 INFO L290 TraceCheckUtils]: 145: Hoare triple {56688#false} assume !false; {56688#false} is VALID [2022-04-27 15:43:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 15:43:41,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:43:41,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944094008] [2022-04-27 15:43:41,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944094008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:43:41,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:43:41,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:43:41,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407630002] [2022-04-27 15:43:41,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:43:41,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2022-04-27 15:43:41,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:43:41,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:41,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:41,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:43:41,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:43:41,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:43:41,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:43:41,849 INFO L87 Difference]: Start difference. First operand 483 states and 719 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:46,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:46,536 INFO L93 Difference]: Finished difference Result 1392 states and 2091 transitions. [2022-04-27 15:43:46,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:43:46,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2022-04-27 15:43:46,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:43:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2022-04-27 15:43:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2022-04-27 15:43:46,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 632 transitions. [2022-04-27 15:43:46,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 632 edges. 632 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:46,959 INFO L225 Difference]: With dead ends: 1392 [2022-04-27 15:43:46,959 INFO L226 Difference]: Without dead ends: 935 [2022-04-27 15:43:46,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:43:46,960 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 144 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:43:46,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 442 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 15:43:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2022-04-27 15:43:46,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 933. [2022-04-27 15:43:46,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:43:46,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 935 states. Second operand has 933 states, 928 states have (on average 1.4892241379310345) internal successors, (1382), 928 states have internal predecessors, (1382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:46,976 INFO L74 IsIncluded]: Start isIncluded. First operand 935 states. Second operand has 933 states, 928 states have (on average 1.4892241379310345) internal successors, (1382), 928 states have internal predecessors, (1382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:46,977 INFO L87 Difference]: Start difference. First operand 935 states. Second operand has 933 states, 928 states have (on average 1.4892241379310345) internal successors, (1382), 928 states have internal predecessors, (1382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:47,013 INFO L93 Difference]: Finished difference Result 935 states and 1387 transitions. [2022-04-27 15:43:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1387 transitions. [2022-04-27 15:43:47,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:47,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:47,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 933 states, 928 states have (on average 1.4892241379310345) internal successors, (1382), 928 states have internal predecessors, (1382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 935 states. [2022-04-27 15:43:47,016 INFO L87 Difference]: Start difference. First operand has 933 states, 928 states have (on average 1.4892241379310345) internal successors, (1382), 928 states have internal predecessors, (1382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 935 states. [2022-04-27 15:43:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:47,052 INFO L93 Difference]: Finished difference Result 935 states and 1387 transitions. [2022-04-27 15:43:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1387 transitions. [2022-04-27 15:43:47,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:47,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:47,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:43:47,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:43:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 928 states have (on average 1.4892241379310345) internal successors, (1382), 928 states have internal predecessors, (1382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1386 transitions. [2022-04-27 15:43:47,085 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1386 transitions. Word has length 146 [2022-04-27 15:43:47,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:43:47,085 INFO L495 AbstractCegarLoop]: Abstraction has 933 states and 1386 transitions. [2022-04-27 15:43:47,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1386 transitions. [2022-04-27 15:43:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-27 15:43:47,086 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:43:47,086 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1] [2022-04-27 15:43:47,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-27 15:43:47,087 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:43:47,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:43:47,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1777793365, now seen corresponding path program 1 times [2022-04-27 15:43:47,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:43:47,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853196595] [2022-04-27 15:43:47,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:43:47,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:43:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:47,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:43:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:47,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {61131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {61124#true} is VALID [2022-04-27 15:43:47,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {61124#true} assume true; {61124#true} is VALID [2022-04-27 15:43:47,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61124#true} {61124#true} #720#return; {61124#true} is VALID [2022-04-27 15:43:47,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {61124#true} call ULTIMATE.init(); {61131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:43:47,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {61131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {61124#true} is VALID [2022-04-27 15:43:47,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {61124#true} assume true; {61124#true} is VALID [2022-04-27 15:43:47,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61124#true} {61124#true} #720#return; {61124#true} is VALID [2022-04-27 15:43:47,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {61124#true} call #t~ret161 := main(); {61124#true} is VALID [2022-04-27 15:43:47,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {61124#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {61124#true} is VALID [2022-04-27 15:43:47,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {61124#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,225 INFO L272 TraceCheckUtils]: 7: Hoare triple {61124#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {61124#true} is VALID [2022-04-27 15:43:47,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {61124#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {61124#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {61124#true} is VALID [2022-04-27 15:43:47,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {61124#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {61124#true} is VALID [2022-04-27 15:43:47,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {61124#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {61124#true} is VALID [2022-04-27 15:43:47,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {61124#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {61124#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {61124#true} is VALID [2022-04-27 15:43:47,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {61124#true} assume !false; {61124#true} is VALID [2022-04-27 15:43:47,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {61124#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {61124#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {61124#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {61124#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {61124#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {61124#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {61124#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {61124#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {61124#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {61124#true} assume 8464 == #t~mem55;havoc #t~mem55; {61124#true} is VALID [2022-04-27 15:43:47,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {61124#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {61124#true} is VALID [2022-04-27 15:43:47,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {61124#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {61124#true} is VALID [2022-04-27 15:43:47,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {61124#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {61124#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {61124#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {61124#true} is VALID [2022-04-27 15:43:47,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {61124#true} ~skip~0 := 0; {61124#true} is VALID [2022-04-27 15:43:47,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {61124#true} assume !false; {61124#true} is VALID [2022-04-27 15:43:47,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {61124#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {61124#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {61124#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {61124#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {61124#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {61124#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {61124#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,228 INFO L290 TraceCheckUtils]: 39: Hoare triple {61124#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {61124#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {61124#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {61124#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {61124#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {61124#true} assume 8496 == #t~mem58;havoc #t~mem58; {61124#true} is VALID [2022-04-27 15:43:47,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {61124#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {61124#true} is VALID [2022-04-27 15:43:47,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {61124#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {61124#true} is VALID [2022-04-27 15:43:47,229 INFO L290 TraceCheckUtils]: 47: Hoare triple {61124#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {61124#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {61124#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {61124#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,229 INFO L290 TraceCheckUtils]: 51: Hoare triple {61124#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {61124#true} is VALID [2022-04-27 15:43:47,229 INFO L290 TraceCheckUtils]: 52: Hoare triple {61124#true} ~skip~0 := 0; {61124#true} is VALID [2022-04-27 15:43:47,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {61124#true} assume !false; {61124#true} is VALID [2022-04-27 15:43:47,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {61124#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,229 INFO L290 TraceCheckUtils]: 55: Hoare triple {61124#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {61124#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,230 INFO L290 TraceCheckUtils]: 57: Hoare triple {61124#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,230 INFO L290 TraceCheckUtils]: 58: Hoare triple {61124#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,230 INFO L290 TraceCheckUtils]: 59: Hoare triple {61124#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,230 INFO L290 TraceCheckUtils]: 60: Hoare triple {61124#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,230 INFO L290 TraceCheckUtils]: 61: Hoare triple {61124#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,230 INFO L290 TraceCheckUtils]: 62: Hoare triple {61124#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,230 INFO L290 TraceCheckUtils]: 63: Hoare triple {61124#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,230 INFO L290 TraceCheckUtils]: 64: Hoare triple {61124#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,230 INFO L290 TraceCheckUtils]: 65: Hoare triple {61124#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,230 INFO L290 TraceCheckUtils]: 66: Hoare triple {61124#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,230 INFO L290 TraceCheckUtils]: 67: Hoare triple {61124#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,230 INFO L290 TraceCheckUtils]: 68: Hoare triple {61124#true} assume 8512 == #t~mem60;havoc #t~mem60; {61124#true} is VALID [2022-04-27 15:43:47,231 INFO L290 TraceCheckUtils]: 69: Hoare triple {61124#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {61124#true} is VALID [2022-04-27 15:43:47,231 INFO L290 TraceCheckUtils]: 70: Hoare triple {61124#true} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {61124#true} is VALID [2022-04-27 15:43:47,232 INFO L290 TraceCheckUtils]: 71: Hoare triple {61124#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,232 INFO L290 TraceCheckUtils]: 72: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,232 INFO L290 TraceCheckUtils]: 73: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,233 INFO L290 TraceCheckUtils]: 74: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,233 INFO L290 TraceCheckUtils]: 75: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,234 INFO L290 TraceCheckUtils]: 76: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,234 INFO L290 TraceCheckUtils]: 77: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,234 INFO L290 TraceCheckUtils]: 78: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,235 INFO L290 TraceCheckUtils]: 79: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,235 INFO L290 TraceCheckUtils]: 80: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,236 INFO L290 TraceCheckUtils]: 81: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,236 INFO L290 TraceCheckUtils]: 82: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,236 INFO L290 TraceCheckUtils]: 83: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,237 INFO L290 TraceCheckUtils]: 84: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,237 INFO L290 TraceCheckUtils]: 85: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,238 INFO L290 TraceCheckUtils]: 86: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,238 INFO L290 TraceCheckUtils]: 87: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,238 INFO L290 TraceCheckUtils]: 88: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,239 INFO L290 TraceCheckUtils]: 89: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,239 INFO L290 TraceCheckUtils]: 90: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:43:47,240 INFO L290 TraceCheckUtils]: 91: Hoare triple {61129#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {61130#(= |ssl3_accept_#t~mem62| 8528)} is VALID [2022-04-27 15:43:47,240 INFO L290 TraceCheckUtils]: 92: Hoare triple {61130#(= |ssl3_accept_#t~mem62| 8528)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,240 INFO L290 TraceCheckUtils]: 93: Hoare triple {61125#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,240 INFO L290 TraceCheckUtils]: 94: Hoare triple {61125#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,240 INFO L290 TraceCheckUtils]: 95: Hoare triple {61125#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,240 INFO L290 TraceCheckUtils]: 96: Hoare triple {61125#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,240 INFO L290 TraceCheckUtils]: 97: Hoare triple {61125#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,240 INFO L290 TraceCheckUtils]: 98: Hoare triple {61125#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,240 INFO L290 TraceCheckUtils]: 99: Hoare triple {61125#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,241 INFO L290 TraceCheckUtils]: 100: Hoare triple {61125#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,241 INFO L290 TraceCheckUtils]: 101: Hoare triple {61125#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,241 INFO L290 TraceCheckUtils]: 102: Hoare triple {61125#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,241 INFO L290 TraceCheckUtils]: 103: Hoare triple {61125#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,241 INFO L290 TraceCheckUtils]: 104: Hoare triple {61125#false} assume 8609 == #t~mem74;havoc #t~mem74; {61125#false} is VALID [2022-04-27 15:43:47,241 INFO L290 TraceCheckUtils]: 105: Hoare triple {61125#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {61125#false} is VALID [2022-04-27 15:43:47,241 INFO L290 TraceCheckUtils]: 106: Hoare triple {61125#false} assume !(8 == ~blastFlag~0); {61125#false} is VALID [2022-04-27 15:43:47,241 INFO L290 TraceCheckUtils]: 107: Hoare triple {61125#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,241 INFO L290 TraceCheckUtils]: 108: Hoare triple {61125#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,241 INFO L290 TraceCheckUtils]: 109: Hoare triple {61125#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {61125#false} is VALID [2022-04-27 15:43:47,241 INFO L290 TraceCheckUtils]: 110: Hoare triple {61125#false} ~skip~0 := 0; {61125#false} is VALID [2022-04-27 15:43:47,241 INFO L290 TraceCheckUtils]: 111: Hoare triple {61125#false} assume !false; {61125#false} is VALID [2022-04-27 15:43:47,242 INFO L290 TraceCheckUtils]: 112: Hoare triple {61125#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,242 INFO L290 TraceCheckUtils]: 113: Hoare triple {61125#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,242 INFO L290 TraceCheckUtils]: 114: Hoare triple {61125#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,242 INFO L290 TraceCheckUtils]: 115: Hoare triple {61125#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,242 INFO L290 TraceCheckUtils]: 116: Hoare triple {61125#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,242 INFO L290 TraceCheckUtils]: 117: Hoare triple {61125#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,242 INFO L290 TraceCheckUtils]: 118: Hoare triple {61125#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,242 INFO L290 TraceCheckUtils]: 119: Hoare triple {61125#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,242 INFO L290 TraceCheckUtils]: 120: Hoare triple {61125#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,242 INFO L290 TraceCheckUtils]: 121: Hoare triple {61125#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,242 INFO L290 TraceCheckUtils]: 122: Hoare triple {61125#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,242 INFO L290 TraceCheckUtils]: 123: Hoare triple {61125#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,243 INFO L290 TraceCheckUtils]: 124: Hoare triple {61125#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,243 INFO L290 TraceCheckUtils]: 125: Hoare triple {61125#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,243 INFO L290 TraceCheckUtils]: 126: Hoare triple {61125#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,243 INFO L290 TraceCheckUtils]: 127: Hoare triple {61125#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,243 INFO L290 TraceCheckUtils]: 128: Hoare triple {61125#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,243 INFO L290 TraceCheckUtils]: 129: Hoare triple {61125#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,243 INFO L290 TraceCheckUtils]: 130: Hoare triple {61125#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,243 INFO L290 TraceCheckUtils]: 131: Hoare triple {61125#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,243 INFO L290 TraceCheckUtils]: 132: Hoare triple {61125#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,243 INFO L290 TraceCheckUtils]: 133: Hoare triple {61125#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,243 INFO L290 TraceCheckUtils]: 134: Hoare triple {61125#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,243 INFO L290 TraceCheckUtils]: 135: Hoare triple {61125#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,244 INFO L290 TraceCheckUtils]: 136: Hoare triple {61125#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,244 INFO L290 TraceCheckUtils]: 137: Hoare triple {61125#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,244 INFO L290 TraceCheckUtils]: 138: Hoare triple {61125#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,244 INFO L290 TraceCheckUtils]: 139: Hoare triple {61125#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,244 INFO L290 TraceCheckUtils]: 140: Hoare triple {61125#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {61125#false} is VALID [2022-04-27 15:43:47,244 INFO L290 TraceCheckUtils]: 141: Hoare triple {61125#false} assume 8640 == #t~mem75;havoc #t~mem75; {61125#false} is VALID [2022-04-27 15:43:47,244 INFO L290 TraceCheckUtils]: 142: Hoare triple {61125#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {61125#false} is VALID [2022-04-27 15:43:47,244 INFO L290 TraceCheckUtils]: 143: Hoare triple {61125#false} assume !(9 == ~blastFlag~0); {61125#false} is VALID [2022-04-27 15:43:47,244 INFO L290 TraceCheckUtils]: 144: Hoare triple {61125#false} assume !(12 == ~blastFlag~0); {61125#false} is VALID [2022-04-27 15:43:47,244 INFO L290 TraceCheckUtils]: 145: Hoare triple {61125#false} assume !false; {61125#false} is VALID [2022-04-27 15:43:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-27 15:43:47,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:43:47,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853196595] [2022-04-27 15:43:47,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853196595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:43:47,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:43:47,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:43:47,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193522730] [2022-04-27 15:43:47,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:43:47,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2022-04-27 15:43:47,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:43:47,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:47,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:47,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:43:47,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:43:47,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:43:47,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:43:47,316 INFO L87 Difference]: Start difference. First operand 933 states and 1386 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:51,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:43:53,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:53,254 INFO L93 Difference]: Finished difference Result 1919 states and 2854 transitions. [2022-04-27 15:43:53,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:43:53,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2022-04-27 15:43:53,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:43:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2022-04-27 15:43:53,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2022-04-27 15:43:53,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 489 transitions. [2022-04-27 15:43:53,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:53,595 INFO L225 Difference]: With dead ends: 1919 [2022-04-27 15:43:53,595 INFO L226 Difference]: Without dead ends: 1012 [2022-04-27 15:43:53,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:43:53,596 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 29 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:43:53,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 619 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-27 15:43:53,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2022-04-27 15:43:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 985. [2022-04-27 15:43:53,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:43:53,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1012 states. Second operand has 985 states, 980 states have (on average 1.4857142857142858) internal successors, (1456), 980 states have internal predecessors, (1456), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:53,612 INFO L74 IsIncluded]: Start isIncluded. First operand 1012 states. Second operand has 985 states, 980 states have (on average 1.4857142857142858) internal successors, (1456), 980 states have internal predecessors, (1456), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:53,613 INFO L87 Difference]: Start difference. First operand 1012 states. Second operand has 985 states, 980 states have (on average 1.4857142857142858) internal successors, (1456), 980 states have internal predecessors, (1456), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:53,653 INFO L93 Difference]: Finished difference Result 1012 states and 1496 transitions. [2022-04-27 15:43:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1496 transitions. [2022-04-27 15:43:53,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:53,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:53,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 985 states, 980 states have (on average 1.4857142857142858) internal successors, (1456), 980 states have internal predecessors, (1456), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1012 states. [2022-04-27 15:43:53,656 INFO L87 Difference]: Start difference. First operand has 985 states, 980 states have (on average 1.4857142857142858) internal successors, (1456), 980 states have internal predecessors, (1456), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1012 states. [2022-04-27 15:43:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:53,686 INFO L93 Difference]: Finished difference Result 1012 states and 1496 transitions. [2022-04-27 15:43:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1496 transitions. [2022-04-27 15:43:53,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:43:53,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:43:53,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:43:53,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:43:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 980 states have (on average 1.4857142857142858) internal successors, (1456), 980 states have internal predecessors, (1456), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1460 transitions. [2022-04-27 15:43:53,714 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1460 transitions. Word has length 146 [2022-04-27 15:43:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:43:53,714 INFO L495 AbstractCegarLoop]: Abstraction has 985 states and 1460 transitions. [2022-04-27 15:43:53,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1460 transitions. [2022-04-27 15:43:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-04-27 15:43:53,716 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:43:53,716 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:43:53,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-27 15:43:53,717 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:43:53,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:43:53,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1615972872, now seen corresponding path program 1 times [2022-04-27 15:43:53,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:43:53,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254961855] [2022-04-27 15:43:53,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:43:53,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:43:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:53,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:43:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:43:53,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {66362#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {66355#true} is VALID [2022-04-27 15:43:53,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {66355#true} assume true; {66355#true} is VALID [2022-04-27 15:43:53,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66355#true} {66355#true} #720#return; {66355#true} is VALID [2022-04-27 15:43:53,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {66355#true} call ULTIMATE.init(); {66362#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:43:53,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {66362#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {66355#true} is VALID [2022-04-27 15:43:53,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {66355#true} assume true; {66355#true} is VALID [2022-04-27 15:43:53,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66355#true} {66355#true} #720#return; {66355#true} is VALID [2022-04-27 15:43:53,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {66355#true} call #t~ret161 := main(); {66355#true} is VALID [2022-04-27 15:43:53,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {66355#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {66355#true} is VALID [2022-04-27 15:43:53,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {66355#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,848 INFO L272 TraceCheckUtils]: 7: Hoare triple {66355#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {66355#true} is VALID [2022-04-27 15:43:53,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {66355#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {66355#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {66355#true} is VALID [2022-04-27 15:43:53,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {66355#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {66355#true} is VALID [2022-04-27 15:43:53,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {66355#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {66355#true} is VALID [2022-04-27 15:43:53,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {66355#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {66355#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {66355#true} is VALID [2022-04-27 15:43:53,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {66355#true} assume !false; {66355#true} is VALID [2022-04-27 15:43:53,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {66355#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {66355#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {66355#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {66355#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {66355#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {66355#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {66355#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {66355#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {66355#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {66355#true} assume 8464 == #t~mem55;havoc #t~mem55; {66355#true} is VALID [2022-04-27 15:43:53,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {66355#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {66355#true} is VALID [2022-04-27 15:43:53,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {66355#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {66355#true} is VALID [2022-04-27 15:43:53,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {66355#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {66355#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {66355#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66355#true} is VALID [2022-04-27 15:43:53,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {66355#true} ~skip~0 := 0; {66355#true} is VALID [2022-04-27 15:43:53,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {66355#true} assume !false; {66355#true} is VALID [2022-04-27 15:43:53,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {66355#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {66355#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {66355#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {66355#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {66355#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {66355#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,851 INFO L290 TraceCheckUtils]: 38: Hoare triple {66355#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,851 INFO L290 TraceCheckUtils]: 39: Hoare triple {66355#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,851 INFO L290 TraceCheckUtils]: 40: Hoare triple {66355#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,851 INFO L290 TraceCheckUtils]: 41: Hoare triple {66355#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,851 INFO L290 TraceCheckUtils]: 42: Hoare triple {66355#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,851 INFO L290 TraceCheckUtils]: 43: Hoare triple {66355#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,851 INFO L290 TraceCheckUtils]: 44: Hoare triple {66355#true} assume 8496 == #t~mem58;havoc #t~mem58; {66355#true} is VALID [2022-04-27 15:43:53,852 INFO L290 TraceCheckUtils]: 45: Hoare triple {66355#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {66355#true} is VALID [2022-04-27 15:43:53,852 INFO L290 TraceCheckUtils]: 46: Hoare triple {66355#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {66355#true} is VALID [2022-04-27 15:43:53,852 INFO L290 TraceCheckUtils]: 47: Hoare triple {66355#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {66355#true} is VALID [2022-04-27 15:43:53,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {66355#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,854 INFO L290 TraceCheckUtils]: 50: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,854 INFO L290 TraceCheckUtils]: 51: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,857 INFO L290 TraceCheckUtils]: 58: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,857 INFO L290 TraceCheckUtils]: 59: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,857 INFO L290 TraceCheckUtils]: 60: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,858 INFO L290 TraceCheckUtils]: 61: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,858 INFO L290 TraceCheckUtils]: 62: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,859 INFO L290 TraceCheckUtils]: 63: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,859 INFO L290 TraceCheckUtils]: 64: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,859 INFO L290 TraceCheckUtils]: 65: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,860 INFO L290 TraceCheckUtils]: 66: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,860 INFO L290 TraceCheckUtils]: 67: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,861 INFO L290 TraceCheckUtils]: 68: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:43:53,862 INFO L290 TraceCheckUtils]: 71: Hoare triple {66360#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {66361#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-27 15:43:53,862 INFO L290 TraceCheckUtils]: 72: Hoare triple {66361#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {66356#false} is VALID [2022-04-27 15:43:53,862 INFO L290 TraceCheckUtils]: 73: Hoare triple {66356#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,862 INFO L290 TraceCheckUtils]: 74: Hoare triple {66356#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,862 INFO L290 TraceCheckUtils]: 75: Hoare triple {66356#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {66356#false} is VALID [2022-04-27 15:43:53,862 INFO L290 TraceCheckUtils]: 76: Hoare triple {66356#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,870 INFO L290 TraceCheckUtils]: 77: Hoare triple {66356#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {66356#false} is VALID [2022-04-27 15:43:53,870 INFO L290 TraceCheckUtils]: 78: Hoare triple {66356#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {66356#false} is VALID [2022-04-27 15:43:53,870 INFO L290 TraceCheckUtils]: 79: Hoare triple {66356#false} assume !(4 == ~blastFlag~0); {66356#false} is VALID [2022-04-27 15:43:53,871 INFO L290 TraceCheckUtils]: 80: Hoare triple {66356#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,871 INFO L290 TraceCheckUtils]: 81: Hoare triple {66356#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,871 INFO L290 TraceCheckUtils]: 82: Hoare triple {66356#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66356#false} is VALID [2022-04-27 15:43:53,871 INFO L290 TraceCheckUtils]: 83: Hoare triple {66356#false} ~skip~0 := 0; {66356#false} is VALID [2022-04-27 15:43:53,872 INFO L290 TraceCheckUtils]: 84: Hoare triple {66356#false} assume !false; {66356#false} is VALID [2022-04-27 15:43:53,872 INFO L290 TraceCheckUtils]: 85: Hoare triple {66356#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,872 INFO L290 TraceCheckUtils]: 86: Hoare triple {66356#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,872 INFO L290 TraceCheckUtils]: 87: Hoare triple {66356#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,872 INFO L290 TraceCheckUtils]: 88: Hoare triple {66356#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,872 INFO L290 TraceCheckUtils]: 89: Hoare triple {66356#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,872 INFO L290 TraceCheckUtils]: 90: Hoare triple {66356#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,872 INFO L290 TraceCheckUtils]: 91: Hoare triple {66356#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,872 INFO L290 TraceCheckUtils]: 92: Hoare triple {66356#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,872 INFO L290 TraceCheckUtils]: 93: Hoare triple {66356#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,872 INFO L290 TraceCheckUtils]: 94: Hoare triple {66356#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,872 INFO L290 TraceCheckUtils]: 95: Hoare triple {66356#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,872 INFO L290 TraceCheckUtils]: 96: Hoare triple {66356#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,873 INFO L290 TraceCheckUtils]: 97: Hoare triple {66356#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,873 INFO L290 TraceCheckUtils]: 98: Hoare triple {66356#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,873 INFO L290 TraceCheckUtils]: 99: Hoare triple {66356#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,873 INFO L290 TraceCheckUtils]: 100: Hoare triple {66356#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,873 INFO L290 TraceCheckUtils]: 101: Hoare triple {66356#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,873 INFO L290 TraceCheckUtils]: 102: Hoare triple {66356#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,873 INFO L290 TraceCheckUtils]: 103: Hoare triple {66356#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,873 INFO L290 TraceCheckUtils]: 104: Hoare triple {66356#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,873 INFO L290 TraceCheckUtils]: 105: Hoare triple {66356#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,873 INFO L290 TraceCheckUtils]: 106: Hoare triple {66356#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,873 INFO L290 TraceCheckUtils]: 107: Hoare triple {66356#false} assume 8448 == #t~mem68;havoc #t~mem68; {66356#false} is VALID [2022-04-27 15:43:53,873 INFO L290 TraceCheckUtils]: 108: Hoare triple {66356#false} assume !(~num1~0 > 0); {66356#false} is VALID [2022-04-27 15:43:53,874 INFO L290 TraceCheckUtils]: 109: Hoare triple {66356#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {66356#false} is VALID [2022-04-27 15:43:53,874 INFO L290 TraceCheckUtils]: 110: Hoare triple {66356#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,874 INFO L290 TraceCheckUtils]: 111: Hoare triple {66356#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66356#false} is VALID [2022-04-27 15:43:53,874 INFO L290 TraceCheckUtils]: 112: Hoare triple {66356#false} ~skip~0 := 0; {66356#false} is VALID [2022-04-27 15:43:53,874 INFO L290 TraceCheckUtils]: 113: Hoare triple {66356#false} assume !false; {66356#false} is VALID [2022-04-27 15:43:53,874 INFO L290 TraceCheckUtils]: 114: Hoare triple {66356#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,874 INFO L290 TraceCheckUtils]: 115: Hoare triple {66356#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,874 INFO L290 TraceCheckUtils]: 116: Hoare triple {66356#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,874 INFO L290 TraceCheckUtils]: 117: Hoare triple {66356#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,874 INFO L290 TraceCheckUtils]: 118: Hoare triple {66356#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,874 INFO L290 TraceCheckUtils]: 119: Hoare triple {66356#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,874 INFO L290 TraceCheckUtils]: 120: Hoare triple {66356#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,875 INFO L290 TraceCheckUtils]: 121: Hoare triple {66356#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,875 INFO L290 TraceCheckUtils]: 122: Hoare triple {66356#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,875 INFO L290 TraceCheckUtils]: 123: Hoare triple {66356#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,875 INFO L290 TraceCheckUtils]: 124: Hoare triple {66356#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,875 INFO L290 TraceCheckUtils]: 125: Hoare triple {66356#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,875 INFO L290 TraceCheckUtils]: 126: Hoare triple {66356#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,875 INFO L290 TraceCheckUtils]: 127: Hoare triple {66356#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,875 INFO L290 TraceCheckUtils]: 128: Hoare triple {66356#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,875 INFO L290 TraceCheckUtils]: 129: Hoare triple {66356#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,875 INFO L290 TraceCheckUtils]: 130: Hoare triple {66356#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,875 INFO L290 TraceCheckUtils]: 131: Hoare triple {66356#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,875 INFO L290 TraceCheckUtils]: 132: Hoare triple {66356#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,876 INFO L290 TraceCheckUtils]: 133: Hoare triple {66356#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,876 INFO L290 TraceCheckUtils]: 134: Hoare triple {66356#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,876 INFO L290 TraceCheckUtils]: 135: Hoare triple {66356#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,876 INFO L290 TraceCheckUtils]: 136: Hoare triple {66356#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,876 INFO L290 TraceCheckUtils]: 137: Hoare triple {66356#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,876 INFO L290 TraceCheckUtils]: 138: Hoare triple {66356#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,876 INFO L290 TraceCheckUtils]: 139: Hoare triple {66356#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,876 INFO L290 TraceCheckUtils]: 140: Hoare triple {66356#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,876 INFO L290 TraceCheckUtils]: 141: Hoare triple {66356#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,876 INFO L290 TraceCheckUtils]: 142: Hoare triple {66356#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {66356#false} is VALID [2022-04-27 15:43:53,876 INFO L290 TraceCheckUtils]: 143: Hoare triple {66356#false} assume 8640 == #t~mem75;havoc #t~mem75; {66356#false} is VALID [2022-04-27 15:43:53,876 INFO L290 TraceCheckUtils]: 144: Hoare triple {66356#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {66356#false} is VALID [2022-04-27 15:43:53,876 INFO L290 TraceCheckUtils]: 145: Hoare triple {66356#false} assume !(9 == ~blastFlag~0); {66356#false} is VALID [2022-04-27 15:43:53,877 INFO L290 TraceCheckUtils]: 146: Hoare triple {66356#false} assume !(12 == ~blastFlag~0); {66356#false} is VALID [2022-04-27 15:43:53,877 INFO L290 TraceCheckUtils]: 147: Hoare triple {66356#false} assume !false; {66356#false} is VALID [2022-04-27 15:43:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 15:43:53,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:43:53,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254961855] [2022-04-27 15:43:53,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254961855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:43:53,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:43:53,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:43:53,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984678547] [2022-04-27 15:43:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:43:53,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 148 [2022-04-27 15:43:53,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:43:53,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:53,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:43:53,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:43:53,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:43:53,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:43:53,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:43:53,979 INFO L87 Difference]: Start difference. First operand 985 states and 1460 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:59,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:43:59,718 INFO L93 Difference]: Finished difference Result 2161 states and 3202 transitions. [2022-04-27 15:43:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:43:59,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 148 [2022-04-27 15:43:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:43:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-04-27 15:43:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:43:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-04-27 15:43:59,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 602 transitions. [2022-04-27 15:44:00,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:00,162 INFO L225 Difference]: With dead ends: 2161 [2022-04-27 15:44:00,163 INFO L226 Difference]: Without dead ends: 1202 [2022-04-27 15:44:00,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:44:00,164 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 129 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:44:00,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 416 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-27 15:44:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2022-04-27 15:44:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1041. [2022-04-27 15:44:00,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:44:00,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1202 states. Second operand has 1041 states, 1036 states have (on average 1.472972972972973) internal successors, (1526), 1036 states have internal predecessors, (1526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:00,181 INFO L74 IsIncluded]: Start isIncluded. First operand 1202 states. Second operand has 1041 states, 1036 states have (on average 1.472972972972973) internal successors, (1526), 1036 states have internal predecessors, (1526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:00,182 INFO L87 Difference]: Start difference. First operand 1202 states. Second operand has 1041 states, 1036 states have (on average 1.472972972972973) internal successors, (1526), 1036 states have internal predecessors, (1526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:00,238 INFO L93 Difference]: Finished difference Result 1202 states and 1758 transitions. [2022-04-27 15:44:00,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1758 transitions. [2022-04-27 15:44:00,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:00,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:00,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 1041 states, 1036 states have (on average 1.472972972972973) internal successors, (1526), 1036 states have internal predecessors, (1526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1202 states. [2022-04-27 15:44:00,242 INFO L87 Difference]: Start difference. First operand has 1041 states, 1036 states have (on average 1.472972972972973) internal successors, (1526), 1036 states have internal predecessors, (1526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1202 states. [2022-04-27 15:44:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:00,300 INFO L93 Difference]: Finished difference Result 1202 states and 1758 transitions. [2022-04-27 15:44:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1758 transitions. [2022-04-27 15:44:00,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:00,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:00,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:44:00,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:44:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 1036 states have (on average 1.472972972972973) internal successors, (1526), 1036 states have internal predecessors, (1526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:00,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1530 transitions. [2022-04-27 15:44:00,351 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1530 transitions. Word has length 148 [2022-04-27 15:44:00,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:44:00,352 INFO L495 AbstractCegarLoop]: Abstraction has 1041 states and 1530 transitions. [2022-04-27 15:44:00,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1530 transitions. [2022-04-27 15:44:00,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-27 15:44:00,353 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:44:00,353 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:44:00,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-27 15:44:00,354 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:44:00,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:44:00,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1721347733, now seen corresponding path program 1 times [2022-04-27 15:44:00,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:44:00,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394863661] [2022-04-27 15:44:00,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:44:00,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:44:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:00,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:44:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:00,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {72310#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {72303#true} is VALID [2022-04-27 15:44:00,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {72303#true} assume true; {72303#true} is VALID [2022-04-27 15:44:00,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72303#true} {72303#true} #720#return; {72303#true} is VALID [2022-04-27 15:44:00,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {72303#true} call ULTIMATE.init(); {72310#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:44:00,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {72310#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {72303#true} is VALID [2022-04-27 15:44:00,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {72303#true} assume true; {72303#true} is VALID [2022-04-27 15:44:00,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72303#true} {72303#true} #720#return; {72303#true} is VALID [2022-04-27 15:44:00,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {72303#true} call #t~ret161 := main(); {72303#true} is VALID [2022-04-27 15:44:00,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {72303#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {72303#true} is VALID [2022-04-27 15:44:00,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {72303#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,485 INFO L272 TraceCheckUtils]: 7: Hoare triple {72303#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {72303#true} is VALID [2022-04-27 15:44:00,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {72303#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {72303#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {72303#true} is VALID [2022-04-27 15:44:00,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {72303#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {72303#true} is VALID [2022-04-27 15:44:00,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {72303#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {72303#true} is VALID [2022-04-27 15:44:00,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {72303#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {72303#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {72303#true} is VALID [2022-04-27 15:44:00,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {72303#true} assume !false; {72303#true} is VALID [2022-04-27 15:44:00,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {72303#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {72303#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {72303#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {72303#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {72303#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {72303#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {72303#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {72303#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {72303#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {72303#true} assume 8464 == #t~mem55;havoc #t~mem55; {72303#true} is VALID [2022-04-27 15:44:00,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {72303#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {72303#true} is VALID [2022-04-27 15:44:00,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {72303#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {72303#true} is VALID [2022-04-27 15:44:00,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {72303#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {72303#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {72303#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {72303#true} is VALID [2022-04-27 15:44:00,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {72303#true} ~skip~0 := 0; {72303#true} is VALID [2022-04-27 15:44:00,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {72303#true} assume !false; {72303#true} is VALID [2022-04-27 15:44:00,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {72303#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {72303#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {72303#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {72303#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {72303#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {72303#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,487 INFO L290 TraceCheckUtils]: 38: Hoare triple {72303#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,487 INFO L290 TraceCheckUtils]: 39: Hoare triple {72303#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {72303#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,487 INFO L290 TraceCheckUtils]: 41: Hoare triple {72303#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,487 INFO L290 TraceCheckUtils]: 42: Hoare triple {72303#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,488 INFO L290 TraceCheckUtils]: 43: Hoare triple {72303#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,488 INFO L290 TraceCheckUtils]: 44: Hoare triple {72303#true} assume 8496 == #t~mem58;havoc #t~mem58; {72303#true} is VALID [2022-04-27 15:44:00,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {72303#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {72303#true} is VALID [2022-04-27 15:44:00,488 INFO L290 TraceCheckUtils]: 46: Hoare triple {72303#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {72303#true} is VALID [2022-04-27 15:44:00,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {72303#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {72303#true} is VALID [2022-04-27 15:44:00,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {72303#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,489 INFO L290 TraceCheckUtils]: 49: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,490 INFO L290 TraceCheckUtils]: 50: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,490 INFO L290 TraceCheckUtils]: 51: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,490 INFO L290 TraceCheckUtils]: 52: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,491 INFO L290 TraceCheckUtils]: 53: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,491 INFO L290 TraceCheckUtils]: 54: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,492 INFO L290 TraceCheckUtils]: 55: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,492 INFO L290 TraceCheckUtils]: 56: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,492 INFO L290 TraceCheckUtils]: 57: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,493 INFO L290 TraceCheckUtils]: 58: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,493 INFO L290 TraceCheckUtils]: 59: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,494 INFO L290 TraceCheckUtils]: 61: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,494 INFO L290 TraceCheckUtils]: 62: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,495 INFO L290 TraceCheckUtils]: 63: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,495 INFO L290 TraceCheckUtils]: 64: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,495 INFO L290 TraceCheckUtils]: 65: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,496 INFO L290 TraceCheckUtils]: 66: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,496 INFO L290 TraceCheckUtils]: 67: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,497 INFO L290 TraceCheckUtils]: 68: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,497 INFO L290 TraceCheckUtils]: 69: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,497 INFO L290 TraceCheckUtils]: 70: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,498 INFO L290 TraceCheckUtils]: 71: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:00,498 INFO L290 TraceCheckUtils]: 72: Hoare triple {72308#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {72309#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-27 15:44:00,498 INFO L290 TraceCheckUtils]: 73: Hoare triple {72309#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {72304#false} is VALID [2022-04-27 15:44:00,498 INFO L290 TraceCheckUtils]: 74: Hoare triple {72304#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,499 INFO L290 TraceCheckUtils]: 75: Hoare triple {72304#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,499 INFO L290 TraceCheckUtils]: 76: Hoare triple {72304#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {72304#false} is VALID [2022-04-27 15:44:00,499 INFO L290 TraceCheckUtils]: 77: Hoare triple {72304#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,499 INFO L290 TraceCheckUtils]: 78: Hoare triple {72304#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {72304#false} is VALID [2022-04-27 15:44:00,499 INFO L290 TraceCheckUtils]: 79: Hoare triple {72304#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {72304#false} is VALID [2022-04-27 15:44:00,499 INFO L290 TraceCheckUtils]: 80: Hoare triple {72304#false} assume !(4 == ~blastFlag~0); {72304#false} is VALID [2022-04-27 15:44:00,499 INFO L290 TraceCheckUtils]: 81: Hoare triple {72304#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,499 INFO L290 TraceCheckUtils]: 82: Hoare triple {72304#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,499 INFO L290 TraceCheckUtils]: 83: Hoare triple {72304#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {72304#false} is VALID [2022-04-27 15:44:00,499 INFO L290 TraceCheckUtils]: 84: Hoare triple {72304#false} ~skip~0 := 0; {72304#false} is VALID [2022-04-27 15:44:00,499 INFO L290 TraceCheckUtils]: 85: Hoare triple {72304#false} assume !false; {72304#false} is VALID [2022-04-27 15:44:00,499 INFO L290 TraceCheckUtils]: 86: Hoare triple {72304#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,500 INFO L290 TraceCheckUtils]: 87: Hoare triple {72304#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,500 INFO L290 TraceCheckUtils]: 88: Hoare triple {72304#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,500 INFO L290 TraceCheckUtils]: 89: Hoare triple {72304#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,500 INFO L290 TraceCheckUtils]: 90: Hoare triple {72304#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,500 INFO L290 TraceCheckUtils]: 91: Hoare triple {72304#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,500 INFO L290 TraceCheckUtils]: 92: Hoare triple {72304#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,500 INFO L290 TraceCheckUtils]: 93: Hoare triple {72304#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,500 INFO L290 TraceCheckUtils]: 94: Hoare triple {72304#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,500 INFO L290 TraceCheckUtils]: 95: Hoare triple {72304#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,500 INFO L290 TraceCheckUtils]: 96: Hoare triple {72304#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,500 INFO L290 TraceCheckUtils]: 97: Hoare triple {72304#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,500 INFO L290 TraceCheckUtils]: 98: Hoare triple {72304#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,500 INFO L290 TraceCheckUtils]: 99: Hoare triple {72304#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,501 INFO L290 TraceCheckUtils]: 100: Hoare triple {72304#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,501 INFO L290 TraceCheckUtils]: 101: Hoare triple {72304#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,501 INFO L290 TraceCheckUtils]: 102: Hoare triple {72304#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,501 INFO L290 TraceCheckUtils]: 103: Hoare triple {72304#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,501 INFO L290 TraceCheckUtils]: 104: Hoare triple {72304#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,501 INFO L290 TraceCheckUtils]: 105: Hoare triple {72304#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,501 INFO L290 TraceCheckUtils]: 106: Hoare triple {72304#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,501 INFO L290 TraceCheckUtils]: 107: Hoare triple {72304#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,501 INFO L290 TraceCheckUtils]: 108: Hoare triple {72304#false} assume 8448 == #t~mem68;havoc #t~mem68; {72304#false} is VALID [2022-04-27 15:44:00,501 INFO L290 TraceCheckUtils]: 109: Hoare triple {72304#false} assume !(~num1~0 > 0); {72304#false} is VALID [2022-04-27 15:44:00,501 INFO L290 TraceCheckUtils]: 110: Hoare triple {72304#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {72304#false} is VALID [2022-04-27 15:44:00,501 INFO L290 TraceCheckUtils]: 111: Hoare triple {72304#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,501 INFO L290 TraceCheckUtils]: 112: Hoare triple {72304#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {72304#false} is VALID [2022-04-27 15:44:00,502 INFO L290 TraceCheckUtils]: 113: Hoare triple {72304#false} ~skip~0 := 0; {72304#false} is VALID [2022-04-27 15:44:00,502 INFO L290 TraceCheckUtils]: 114: Hoare triple {72304#false} assume !false; {72304#false} is VALID [2022-04-27 15:44:00,502 INFO L290 TraceCheckUtils]: 115: Hoare triple {72304#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,502 INFO L290 TraceCheckUtils]: 116: Hoare triple {72304#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,502 INFO L290 TraceCheckUtils]: 117: Hoare triple {72304#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,502 INFO L290 TraceCheckUtils]: 118: Hoare triple {72304#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,502 INFO L290 TraceCheckUtils]: 119: Hoare triple {72304#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,502 INFO L290 TraceCheckUtils]: 120: Hoare triple {72304#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,502 INFO L290 TraceCheckUtils]: 121: Hoare triple {72304#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,502 INFO L290 TraceCheckUtils]: 122: Hoare triple {72304#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,502 INFO L290 TraceCheckUtils]: 123: Hoare triple {72304#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,502 INFO L290 TraceCheckUtils]: 124: Hoare triple {72304#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,503 INFO L290 TraceCheckUtils]: 125: Hoare triple {72304#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,503 INFO L290 TraceCheckUtils]: 126: Hoare triple {72304#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,503 INFO L290 TraceCheckUtils]: 127: Hoare triple {72304#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,503 INFO L290 TraceCheckUtils]: 128: Hoare triple {72304#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,503 INFO L290 TraceCheckUtils]: 129: Hoare triple {72304#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,503 INFO L290 TraceCheckUtils]: 130: Hoare triple {72304#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,503 INFO L290 TraceCheckUtils]: 131: Hoare triple {72304#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,503 INFO L290 TraceCheckUtils]: 132: Hoare triple {72304#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,503 INFO L290 TraceCheckUtils]: 133: Hoare triple {72304#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,503 INFO L290 TraceCheckUtils]: 134: Hoare triple {72304#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,503 INFO L290 TraceCheckUtils]: 135: Hoare triple {72304#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,503 INFO L290 TraceCheckUtils]: 136: Hoare triple {72304#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,504 INFO L290 TraceCheckUtils]: 137: Hoare triple {72304#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,504 INFO L290 TraceCheckUtils]: 138: Hoare triple {72304#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,504 INFO L290 TraceCheckUtils]: 139: Hoare triple {72304#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,504 INFO L290 TraceCheckUtils]: 140: Hoare triple {72304#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,504 INFO L290 TraceCheckUtils]: 141: Hoare triple {72304#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,504 INFO L290 TraceCheckUtils]: 142: Hoare triple {72304#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,504 INFO L290 TraceCheckUtils]: 143: Hoare triple {72304#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {72304#false} is VALID [2022-04-27 15:44:00,504 INFO L290 TraceCheckUtils]: 144: Hoare triple {72304#false} assume 8640 == #t~mem75;havoc #t~mem75; {72304#false} is VALID [2022-04-27 15:44:00,504 INFO L290 TraceCheckUtils]: 145: Hoare triple {72304#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {72304#false} is VALID [2022-04-27 15:44:00,504 INFO L290 TraceCheckUtils]: 146: Hoare triple {72304#false} assume !(9 == ~blastFlag~0); {72304#false} is VALID [2022-04-27 15:44:00,504 INFO L290 TraceCheckUtils]: 147: Hoare triple {72304#false} assume !(12 == ~blastFlag~0); {72304#false} is VALID [2022-04-27 15:44:00,504 INFO L290 TraceCheckUtils]: 148: Hoare triple {72304#false} assume !false; {72304#false} is VALID [2022-04-27 15:44:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 15:44:00,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:44:00,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394863661] [2022-04-27 15:44:00,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394863661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:44:00,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:44:00,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:44:00,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629318733] [2022-04-27 15:44:00,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:44:00,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-27 15:44:00,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:44:00,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:00,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:00,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:44:00,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:44:00,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:44:00,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:44:00,593 INFO L87 Difference]: Start difference. First operand 1041 states and 1530 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:05,040 INFO L93 Difference]: Finished difference Result 2193 states and 3220 transitions. [2022-04-27 15:44:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:44:05,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-27 15:44:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:44:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-04-27 15:44:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:05,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-04-27 15:44:05,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 602 transitions. [2022-04-27 15:44:05,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:05,488 INFO L225 Difference]: With dead ends: 2193 [2022-04-27 15:44:05,489 INFO L226 Difference]: Without dead ends: 1178 [2022-04-27 15:44:05,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:44:05,490 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 128 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:44:05,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 396 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 15:44:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2022-04-27 15:44:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1041. [2022-04-27 15:44:05,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:44:05,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1178 states. Second operand has 1041 states, 1036 states have (on average 1.4594594594594594) internal successors, (1512), 1036 states have internal predecessors, (1512), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:05,509 INFO L74 IsIncluded]: Start isIncluded. First operand 1178 states. Second operand has 1041 states, 1036 states have (on average 1.4594594594594594) internal successors, (1512), 1036 states have internal predecessors, (1512), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:05,510 INFO L87 Difference]: Start difference. First operand 1178 states. Second operand has 1041 states, 1036 states have (on average 1.4594594594594594) internal successors, (1512), 1036 states have internal predecessors, (1512), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:05,563 INFO L93 Difference]: Finished difference Result 1178 states and 1706 transitions. [2022-04-27 15:44:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1706 transitions. [2022-04-27 15:44:05,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:05,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:05,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 1041 states, 1036 states have (on average 1.4594594594594594) internal successors, (1512), 1036 states have internal predecessors, (1512), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1178 states. [2022-04-27 15:44:05,566 INFO L87 Difference]: Start difference. First operand has 1041 states, 1036 states have (on average 1.4594594594594594) internal successors, (1512), 1036 states have internal predecessors, (1512), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1178 states. [2022-04-27 15:44:05,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:05,602 INFO L93 Difference]: Finished difference Result 1178 states and 1706 transitions. [2022-04-27 15:44:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1706 transitions. [2022-04-27 15:44:05,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:05,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:05,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:44:05,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:44:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 1036 states have (on average 1.4594594594594594) internal successors, (1512), 1036 states have internal predecessors, (1512), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1516 transitions. [2022-04-27 15:44:05,635 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1516 transitions. Word has length 149 [2022-04-27 15:44:05,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:44:05,635 INFO L495 AbstractCegarLoop]: Abstraction has 1041 states and 1516 transitions. [2022-04-27 15:44:05,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:05,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1516 transitions. [2022-04-27 15:44:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-04-27 15:44:05,636 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:44:05,636 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2022-04-27 15:44:05,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-27 15:44:05,637 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:44:05,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:44:05,637 INFO L85 PathProgramCache]: Analyzing trace with hash -411292190, now seen corresponding path program 1 times [2022-04-27 15:44:05,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:44:05,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027422014] [2022-04-27 15:44:05,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:44:05,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:44:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:05,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:44:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:05,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {78246#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {78239#true} is VALID [2022-04-27 15:44:05,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {78239#true} assume true; {78239#true} is VALID [2022-04-27 15:44:05,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78239#true} {78239#true} #720#return; {78239#true} is VALID [2022-04-27 15:44:05,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {78239#true} call ULTIMATE.init(); {78246#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:44:05,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {78246#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {78239#true} is VALID [2022-04-27 15:44:05,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {78239#true} assume true; {78239#true} is VALID [2022-04-27 15:44:05,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78239#true} {78239#true} #720#return; {78239#true} is VALID [2022-04-27 15:44:05,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {78239#true} call #t~ret161 := main(); {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {78239#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {78239#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L272 TraceCheckUtils]: 7: Hoare triple {78239#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {78239#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {78239#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {78239#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {78239#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {78239#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {78239#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {78239#true} assume !false; {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {78239#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {78239#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {78239#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {78239#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {78239#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {78239#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {78239#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {78239#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {78239#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {78239#true} assume 8464 == #t~mem55;havoc #t~mem55; {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {78239#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {78239#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {78239#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {78239#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {78239#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {78239#true} ~skip~0 := 0; {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {78239#true} assume !false; {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {78239#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {78239#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {78239#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {78239#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {78239#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {78239#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {78239#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {78239#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {78239#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {78239#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {78239#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {78239#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {78239#true} assume 8496 == #t~mem58;havoc #t~mem58; {78239#true} is VALID [2022-04-27 15:44:05,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {78239#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {78239#true} is VALID [2022-04-27 15:44:05,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {78239#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {78239#true} is VALID [2022-04-27 15:44:05,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {78239#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {78239#true} is VALID [2022-04-27 15:44:05,770 INFO L290 TraceCheckUtils]: 48: Hoare triple {78239#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,772 INFO L290 TraceCheckUtils]: 50: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,772 INFO L290 TraceCheckUtils]: 51: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,772 INFO L290 TraceCheckUtils]: 53: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,773 INFO L290 TraceCheckUtils]: 54: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,773 INFO L290 TraceCheckUtils]: 55: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,775 INFO L290 TraceCheckUtils]: 59: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,775 INFO L290 TraceCheckUtils]: 60: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,776 INFO L290 TraceCheckUtils]: 62: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,776 INFO L290 TraceCheckUtils]: 63: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,777 INFO L290 TraceCheckUtils]: 64: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,777 INFO L290 TraceCheckUtils]: 65: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,777 INFO L290 TraceCheckUtils]: 66: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,778 INFO L290 TraceCheckUtils]: 67: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,778 INFO L290 TraceCheckUtils]: 68: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:05,778 INFO L290 TraceCheckUtils]: 69: Hoare triple {78244#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {78245#(not (= |ssl3_accept_#t~mem62| 8528))} is VALID [2022-04-27 15:44:05,779 INFO L290 TraceCheckUtils]: 70: Hoare triple {78245#(not (= |ssl3_accept_#t~mem62| 8528))} assume 8528 == #t~mem62;havoc #t~mem62; {78240#false} is VALID [2022-04-27 15:44:05,779 INFO L290 TraceCheckUtils]: 71: Hoare triple {78240#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,779 INFO L290 TraceCheckUtils]: 72: Hoare triple {78240#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {78240#false} is VALID [2022-04-27 15:44:05,779 INFO L290 TraceCheckUtils]: 73: Hoare triple {78240#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,779 INFO L290 TraceCheckUtils]: 74: Hoare triple {78240#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {78240#false} is VALID [2022-04-27 15:44:05,779 INFO L290 TraceCheckUtils]: 75: Hoare triple {78240#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {78240#false} is VALID [2022-04-27 15:44:05,779 INFO L290 TraceCheckUtils]: 76: Hoare triple {78240#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {78240#false} is VALID [2022-04-27 15:44:05,779 INFO L290 TraceCheckUtils]: 77: Hoare triple {78240#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,779 INFO L290 TraceCheckUtils]: 78: Hoare triple {78240#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,779 INFO L290 TraceCheckUtils]: 79: Hoare triple {78240#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {78240#false} is VALID [2022-04-27 15:44:05,779 INFO L290 TraceCheckUtils]: 80: Hoare triple {78240#false} ~skip~0 := 0; {78240#false} is VALID [2022-04-27 15:44:05,779 INFO L290 TraceCheckUtils]: 81: Hoare triple {78240#false} assume !false; {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 82: Hoare triple {78240#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 83: Hoare triple {78240#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 84: Hoare triple {78240#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 85: Hoare triple {78240#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 86: Hoare triple {78240#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 87: Hoare triple {78240#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 88: Hoare triple {78240#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 89: Hoare triple {78240#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 90: Hoare triple {78240#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 91: Hoare triple {78240#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 92: Hoare triple {78240#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 93: Hoare triple {78240#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 94: Hoare triple {78240#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 95: Hoare triple {78240#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 96: Hoare triple {78240#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 97: Hoare triple {78240#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,780 INFO L290 TraceCheckUtils]: 98: Hoare triple {78240#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 99: Hoare triple {78240#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 100: Hoare triple {78240#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 101: Hoare triple {78240#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 102: Hoare triple {78240#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 103: Hoare triple {78240#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 104: Hoare triple {78240#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 105: Hoare triple {78240#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 106: Hoare triple {78240#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 107: Hoare triple {78240#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 108: Hoare triple {78240#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 109: Hoare triple {78240#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 110: Hoare triple {78240#false} assume 8609 == #t~mem74;havoc #t~mem74; {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 111: Hoare triple {78240#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 112: Hoare triple {78240#false} assume !(8 == ~blastFlag~0); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 113: Hoare triple {78240#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 114: Hoare triple {78240#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 115: Hoare triple {78240#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {78240#false} is VALID [2022-04-27 15:44:05,781 INFO L290 TraceCheckUtils]: 116: Hoare triple {78240#false} ~skip~0 := 0; {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 117: Hoare triple {78240#false} assume !false; {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 118: Hoare triple {78240#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 119: Hoare triple {78240#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 120: Hoare triple {78240#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 121: Hoare triple {78240#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 122: Hoare triple {78240#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 123: Hoare triple {78240#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 124: Hoare triple {78240#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 125: Hoare triple {78240#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 126: Hoare triple {78240#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 127: Hoare triple {78240#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 128: Hoare triple {78240#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 129: Hoare triple {78240#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 130: Hoare triple {78240#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 131: Hoare triple {78240#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 132: Hoare triple {78240#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,782 INFO L290 TraceCheckUtils]: 133: Hoare triple {78240#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 134: Hoare triple {78240#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 135: Hoare triple {78240#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 136: Hoare triple {78240#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 137: Hoare triple {78240#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 138: Hoare triple {78240#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 139: Hoare triple {78240#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 140: Hoare triple {78240#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 141: Hoare triple {78240#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 142: Hoare triple {78240#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 143: Hoare triple {78240#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 144: Hoare triple {78240#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 145: Hoare triple {78240#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 146: Hoare triple {78240#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 147: Hoare triple {78240#false} assume 8640 == #t~mem75;havoc #t~mem75; {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 148: Hoare triple {78240#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 149: Hoare triple {78240#false} assume !(9 == ~blastFlag~0); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 150: Hoare triple {78240#false} assume !(12 == ~blastFlag~0); {78240#false} is VALID [2022-04-27 15:44:05,783 INFO L290 TraceCheckUtils]: 151: Hoare triple {78240#false} assume !false; {78240#false} is VALID [2022-04-27 15:44:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 15:44:05,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:44:05,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027422014] [2022-04-27 15:44:05,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027422014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:44:05,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:44:05,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:44:05,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128714184] [2022-04-27 15:44:05,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:44:05,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2022-04-27 15:44:05,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:44:05,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:05,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:05,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:44:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:44:05,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:44:05,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:44:05,861 INFO L87 Difference]: Start difference. First operand 1041 states and 1516 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:09,866 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:44:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:12,954 INFO L93 Difference]: Finished difference Result 2193 states and 3192 transitions. [2022-04-27 15:44:12,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:44:12,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2022-04-27 15:44:12,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:44:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2022-04-27 15:44:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2022-04-27 15:44:12,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 601 transitions. [2022-04-27 15:44:13,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 601 edges. 601 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:13,428 INFO L225 Difference]: With dead ends: 2193 [2022-04-27 15:44:13,428 INFO L226 Difference]: Without dead ends: 1178 [2022-04-27 15:44:13,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:44:13,429 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 130 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:44:13,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 396 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-27 15:44:13,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2022-04-27 15:44:13,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1041. [2022-04-27 15:44:13,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:44:13,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1178 states. Second operand has 1041 states, 1036 states have (on average 1.444015444015444) internal successors, (1496), 1036 states have internal predecessors, (1496), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:13,443 INFO L74 IsIncluded]: Start isIncluded. First operand 1178 states. Second operand has 1041 states, 1036 states have (on average 1.444015444015444) internal successors, (1496), 1036 states have internal predecessors, (1496), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:13,443 INFO L87 Difference]: Start difference. First operand 1178 states. Second operand has 1041 states, 1036 states have (on average 1.444015444015444) internal successors, (1496), 1036 states have internal predecessors, (1496), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:13,482 INFO L93 Difference]: Finished difference Result 1178 states and 1690 transitions. [2022-04-27 15:44:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1690 transitions. [2022-04-27 15:44:13,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:13,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:13,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 1041 states, 1036 states have (on average 1.444015444015444) internal successors, (1496), 1036 states have internal predecessors, (1496), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1178 states. [2022-04-27 15:44:13,484 INFO L87 Difference]: Start difference. First operand has 1041 states, 1036 states have (on average 1.444015444015444) internal successors, (1496), 1036 states have internal predecessors, (1496), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1178 states. [2022-04-27 15:44:13,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:13,517 INFO L93 Difference]: Finished difference Result 1178 states and 1690 transitions. [2022-04-27 15:44:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1690 transitions. [2022-04-27 15:44:13,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:13,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:13,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:44:13,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:44:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 1036 states have (on average 1.444015444015444) internal successors, (1496), 1036 states have internal predecessors, (1496), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1500 transitions. [2022-04-27 15:44:13,548 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1500 transitions. Word has length 152 [2022-04-27 15:44:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:44:13,548 INFO L495 AbstractCegarLoop]: Abstraction has 1041 states and 1500 transitions. [2022-04-27 15:44:13,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1500 transitions. [2022-04-27 15:44:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-27 15:44:13,549 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:44:13,550 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:44:13,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-27 15:44:13,550 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:44:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:44:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash 843620453, now seen corresponding path program 1 times [2022-04-27 15:44:13,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:44:13,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402107118] [2022-04-27 15:44:13,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:44:13,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:44:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:13,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:44:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:13,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {84182#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {84175#true} is VALID [2022-04-27 15:44:13,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {84175#true} assume true; {84175#true} is VALID [2022-04-27 15:44:13,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84175#true} {84175#true} #720#return; {84175#true} is VALID [2022-04-27 15:44:13,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {84175#true} call ULTIMATE.init(); {84182#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:44:13,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {84182#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {84175#true} is VALID [2022-04-27 15:44:13,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {84175#true} assume true; {84175#true} is VALID [2022-04-27 15:44:13,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84175#true} {84175#true} #720#return; {84175#true} is VALID [2022-04-27 15:44:13,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {84175#true} call #t~ret161 := main(); {84175#true} is VALID [2022-04-27 15:44:13,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {84175#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {84175#true} is VALID [2022-04-27 15:44:13,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {84175#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,688 INFO L272 TraceCheckUtils]: 7: Hoare triple {84175#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {84175#true} is VALID [2022-04-27 15:44:13,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {84175#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {84175#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {84175#true} is VALID [2022-04-27 15:44:13,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {84175#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {84175#true} is VALID [2022-04-27 15:44:13,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {84175#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {84175#true} is VALID [2022-04-27 15:44:13,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {84175#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {84175#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {84175#true} is VALID [2022-04-27 15:44:13,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {84175#true} assume !false; {84175#true} is VALID [2022-04-27 15:44:13,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {84175#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {84175#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {84175#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {84175#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {84175#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {84175#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {84175#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {84175#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {84175#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {84175#true} assume 8464 == #t~mem55;havoc #t~mem55; {84175#true} is VALID [2022-04-27 15:44:13,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {84175#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {84175#true} is VALID [2022-04-27 15:44:13,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {84175#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {84175#true} is VALID [2022-04-27 15:44:13,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {84175#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {84175#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {84175#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {84175#true} is VALID [2022-04-27 15:44:13,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {84175#true} ~skip~0 := 0; {84175#true} is VALID [2022-04-27 15:44:13,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {84175#true} assume !false; {84175#true} is VALID [2022-04-27 15:44:13,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {84175#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {84175#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {84175#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {84175#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {84175#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {84175#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {84175#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,690 INFO L290 TraceCheckUtils]: 39: Hoare triple {84175#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {84175#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {84175#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {84175#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {84175#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,690 INFO L290 TraceCheckUtils]: 44: Hoare triple {84175#true} assume 8496 == #t~mem58;havoc #t~mem58; {84175#true} is VALID [2022-04-27 15:44:13,691 INFO L290 TraceCheckUtils]: 45: Hoare triple {84175#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {84175#true} is VALID [2022-04-27 15:44:13,691 INFO L290 TraceCheckUtils]: 46: Hoare triple {84175#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {84175#true} is VALID [2022-04-27 15:44:13,691 INFO L290 TraceCheckUtils]: 47: Hoare triple {84175#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {84175#true} is VALID [2022-04-27 15:44:13,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {84175#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,692 INFO L290 TraceCheckUtils]: 49: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,693 INFO L290 TraceCheckUtils]: 50: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,693 INFO L290 TraceCheckUtils]: 51: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,694 INFO L290 TraceCheckUtils]: 53: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,694 INFO L290 TraceCheckUtils]: 54: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,694 INFO L290 TraceCheckUtils]: 55: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,695 INFO L290 TraceCheckUtils]: 56: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,695 INFO L290 TraceCheckUtils]: 57: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,696 INFO L290 TraceCheckUtils]: 58: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,696 INFO L290 TraceCheckUtils]: 59: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,696 INFO L290 TraceCheckUtils]: 60: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,697 INFO L290 TraceCheckUtils]: 61: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,697 INFO L290 TraceCheckUtils]: 62: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,698 INFO L290 TraceCheckUtils]: 63: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,698 INFO L290 TraceCheckUtils]: 64: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,698 INFO L290 TraceCheckUtils]: 65: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,699 INFO L290 TraceCheckUtils]: 66: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,699 INFO L290 TraceCheckUtils]: 67: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,700 INFO L290 TraceCheckUtils]: 68: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,700 INFO L290 TraceCheckUtils]: 69: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:13,700 INFO L290 TraceCheckUtils]: 70: Hoare triple {84180#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {84181#(= |ssl3_accept_#t~mem63| 8656)} is VALID [2022-04-27 15:44:13,701 INFO L290 TraceCheckUtils]: 71: Hoare triple {84181#(= |ssl3_accept_#t~mem63| 8656)} assume 8529 == #t~mem63;havoc #t~mem63; {84176#false} is VALID [2022-04-27 15:44:13,701 INFO L290 TraceCheckUtils]: 72: Hoare triple {84176#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,701 INFO L290 TraceCheckUtils]: 73: Hoare triple {84176#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {84176#false} is VALID [2022-04-27 15:44:13,701 INFO L290 TraceCheckUtils]: 74: Hoare triple {84176#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,701 INFO L290 TraceCheckUtils]: 75: Hoare triple {84176#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {84176#false} is VALID [2022-04-27 15:44:13,701 INFO L290 TraceCheckUtils]: 76: Hoare triple {84176#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {84176#false} is VALID [2022-04-27 15:44:13,701 INFO L290 TraceCheckUtils]: 77: Hoare triple {84176#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {84176#false} is VALID [2022-04-27 15:44:13,701 INFO L290 TraceCheckUtils]: 78: Hoare triple {84176#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,701 INFO L290 TraceCheckUtils]: 79: Hoare triple {84176#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,702 INFO L290 TraceCheckUtils]: 80: Hoare triple {84176#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {84176#false} is VALID [2022-04-27 15:44:13,702 INFO L290 TraceCheckUtils]: 81: Hoare triple {84176#false} ~skip~0 := 0; {84176#false} is VALID [2022-04-27 15:44:13,702 INFO L290 TraceCheckUtils]: 82: Hoare triple {84176#false} assume !false; {84176#false} is VALID [2022-04-27 15:44:13,702 INFO L290 TraceCheckUtils]: 83: Hoare triple {84176#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,702 INFO L290 TraceCheckUtils]: 84: Hoare triple {84176#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,702 INFO L290 TraceCheckUtils]: 85: Hoare triple {84176#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,702 INFO L290 TraceCheckUtils]: 86: Hoare triple {84176#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,702 INFO L290 TraceCheckUtils]: 87: Hoare triple {84176#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,702 INFO L290 TraceCheckUtils]: 88: Hoare triple {84176#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,702 INFO L290 TraceCheckUtils]: 89: Hoare triple {84176#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,702 INFO L290 TraceCheckUtils]: 90: Hoare triple {84176#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,702 INFO L290 TraceCheckUtils]: 91: Hoare triple {84176#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,702 INFO L290 TraceCheckUtils]: 92: Hoare triple {84176#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,703 INFO L290 TraceCheckUtils]: 93: Hoare triple {84176#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,703 INFO L290 TraceCheckUtils]: 94: Hoare triple {84176#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,703 INFO L290 TraceCheckUtils]: 95: Hoare triple {84176#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,703 INFO L290 TraceCheckUtils]: 96: Hoare triple {84176#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,703 INFO L290 TraceCheckUtils]: 97: Hoare triple {84176#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,703 INFO L290 TraceCheckUtils]: 98: Hoare triple {84176#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,703 INFO L290 TraceCheckUtils]: 99: Hoare triple {84176#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,703 INFO L290 TraceCheckUtils]: 100: Hoare triple {84176#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,703 INFO L290 TraceCheckUtils]: 101: Hoare triple {84176#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,703 INFO L290 TraceCheckUtils]: 102: Hoare triple {84176#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,703 INFO L290 TraceCheckUtils]: 103: Hoare triple {84176#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,703 INFO L290 TraceCheckUtils]: 104: Hoare triple {84176#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,703 INFO L290 TraceCheckUtils]: 105: Hoare triple {84176#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,704 INFO L290 TraceCheckUtils]: 106: Hoare triple {84176#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,704 INFO L290 TraceCheckUtils]: 107: Hoare triple {84176#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,704 INFO L290 TraceCheckUtils]: 108: Hoare triple {84176#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,704 INFO L290 TraceCheckUtils]: 109: Hoare triple {84176#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,704 INFO L290 TraceCheckUtils]: 110: Hoare triple {84176#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,704 INFO L290 TraceCheckUtils]: 111: Hoare triple {84176#false} assume 8609 == #t~mem74;havoc #t~mem74; {84176#false} is VALID [2022-04-27 15:44:13,704 INFO L290 TraceCheckUtils]: 112: Hoare triple {84176#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {84176#false} is VALID [2022-04-27 15:44:13,704 INFO L290 TraceCheckUtils]: 113: Hoare triple {84176#false} assume !(8 == ~blastFlag~0); {84176#false} is VALID [2022-04-27 15:44:13,704 INFO L290 TraceCheckUtils]: 114: Hoare triple {84176#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,704 INFO L290 TraceCheckUtils]: 115: Hoare triple {84176#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,704 INFO L290 TraceCheckUtils]: 116: Hoare triple {84176#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {84176#false} is VALID [2022-04-27 15:44:13,704 INFO L290 TraceCheckUtils]: 117: Hoare triple {84176#false} ~skip~0 := 0; {84176#false} is VALID [2022-04-27 15:44:13,704 INFO L290 TraceCheckUtils]: 118: Hoare triple {84176#false} assume !false; {84176#false} is VALID [2022-04-27 15:44:13,705 INFO L290 TraceCheckUtils]: 119: Hoare triple {84176#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,705 INFO L290 TraceCheckUtils]: 120: Hoare triple {84176#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,705 INFO L290 TraceCheckUtils]: 121: Hoare triple {84176#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,705 INFO L290 TraceCheckUtils]: 122: Hoare triple {84176#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,705 INFO L290 TraceCheckUtils]: 123: Hoare triple {84176#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,705 INFO L290 TraceCheckUtils]: 124: Hoare triple {84176#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,705 INFO L290 TraceCheckUtils]: 125: Hoare triple {84176#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,705 INFO L290 TraceCheckUtils]: 126: Hoare triple {84176#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,705 INFO L290 TraceCheckUtils]: 127: Hoare triple {84176#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,705 INFO L290 TraceCheckUtils]: 128: Hoare triple {84176#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,705 INFO L290 TraceCheckUtils]: 129: Hoare triple {84176#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,705 INFO L290 TraceCheckUtils]: 130: Hoare triple {84176#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,706 INFO L290 TraceCheckUtils]: 131: Hoare triple {84176#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,706 INFO L290 TraceCheckUtils]: 132: Hoare triple {84176#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,706 INFO L290 TraceCheckUtils]: 133: Hoare triple {84176#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,706 INFO L290 TraceCheckUtils]: 134: Hoare triple {84176#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,706 INFO L290 TraceCheckUtils]: 135: Hoare triple {84176#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,706 INFO L290 TraceCheckUtils]: 136: Hoare triple {84176#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,706 INFO L290 TraceCheckUtils]: 137: Hoare triple {84176#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,706 INFO L290 TraceCheckUtils]: 138: Hoare triple {84176#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,706 INFO L290 TraceCheckUtils]: 139: Hoare triple {84176#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,706 INFO L290 TraceCheckUtils]: 140: Hoare triple {84176#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,706 INFO L290 TraceCheckUtils]: 141: Hoare triple {84176#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,706 INFO L290 TraceCheckUtils]: 142: Hoare triple {84176#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,706 INFO L290 TraceCheckUtils]: 143: Hoare triple {84176#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,707 INFO L290 TraceCheckUtils]: 144: Hoare triple {84176#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,707 INFO L290 TraceCheckUtils]: 145: Hoare triple {84176#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,707 INFO L290 TraceCheckUtils]: 146: Hoare triple {84176#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,707 INFO L290 TraceCheckUtils]: 147: Hoare triple {84176#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {84176#false} is VALID [2022-04-27 15:44:13,707 INFO L290 TraceCheckUtils]: 148: Hoare triple {84176#false} assume 8640 == #t~mem75;havoc #t~mem75; {84176#false} is VALID [2022-04-27 15:44:13,707 INFO L290 TraceCheckUtils]: 149: Hoare triple {84176#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {84176#false} is VALID [2022-04-27 15:44:13,707 INFO L290 TraceCheckUtils]: 150: Hoare triple {84176#false} assume !(9 == ~blastFlag~0); {84176#false} is VALID [2022-04-27 15:44:13,707 INFO L290 TraceCheckUtils]: 151: Hoare triple {84176#false} assume !(12 == ~blastFlag~0); {84176#false} is VALID [2022-04-27 15:44:13,707 INFO L290 TraceCheckUtils]: 152: Hoare triple {84176#false} assume !false; {84176#false} is VALID [2022-04-27 15:44:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 15:44:13,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:44:13,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402107118] [2022-04-27 15:44:13,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402107118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:44:13,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:44:13,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:44:13,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930274395] [2022-04-27 15:44:13,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:44:13,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-27 15:44:13,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:44:13,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:13,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:13,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:44:13,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:44:13,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:44:13,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:44:13,787 INFO L87 Difference]: Start difference. First operand 1041 states and 1500 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:16,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:44:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:19,124 INFO L93 Difference]: Finished difference Result 2099 states and 3025 transitions. [2022-04-27 15:44:19,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:44:19,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-27 15:44:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:44:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2022-04-27 15:44:19,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:19,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2022-04-27 15:44:19,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 521 transitions. [2022-04-27 15:44:19,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 521 edges. 521 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:19,492 INFO L225 Difference]: With dead ends: 2099 [2022-04-27 15:44:19,492 INFO L226 Difference]: Without dead ends: 1084 [2022-04-27 15:44:19,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:44:19,493 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 56 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:44:19,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 569 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-27 15:44:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2022-04-27 15:44:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1041. [2022-04-27 15:44:19,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:44:19,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1084 states. Second operand has 1041 states, 1036 states have (on average 1.442084942084942) internal successors, (1494), 1036 states have internal predecessors, (1494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:19,516 INFO L74 IsIncluded]: Start isIncluded. First operand 1084 states. Second operand has 1041 states, 1036 states have (on average 1.442084942084942) internal successors, (1494), 1036 states have internal predecessors, (1494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:19,517 INFO L87 Difference]: Start difference. First operand 1084 states. Second operand has 1041 states, 1036 states have (on average 1.442084942084942) internal successors, (1494), 1036 states have internal predecessors, (1494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:19,546 INFO L93 Difference]: Finished difference Result 1084 states and 1553 transitions. [2022-04-27 15:44:19,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1553 transitions. [2022-04-27 15:44:19,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:19,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:19,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 1041 states, 1036 states have (on average 1.442084942084942) internal successors, (1494), 1036 states have internal predecessors, (1494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1084 states. [2022-04-27 15:44:19,548 INFO L87 Difference]: Start difference. First operand has 1041 states, 1036 states have (on average 1.442084942084942) internal successors, (1494), 1036 states have internal predecessors, (1494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1084 states. [2022-04-27 15:44:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:19,577 INFO L93 Difference]: Finished difference Result 1084 states and 1553 transitions. [2022-04-27 15:44:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1553 transitions. [2022-04-27 15:44:19,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:19,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:19,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:44:19,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:44:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 1036 states have (on average 1.442084942084942) internal successors, (1494), 1036 states have internal predecessors, (1494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1498 transitions. [2022-04-27 15:44:19,607 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1498 transitions. Word has length 153 [2022-04-27 15:44:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:44:19,607 INFO L495 AbstractCegarLoop]: Abstraction has 1041 states and 1498 transitions. [2022-04-27 15:44:19,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1498 transitions. [2022-04-27 15:44:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-27 15:44:19,608 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:44:19,608 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:44:19,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-27 15:44:19,608 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:44:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:44:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1632047552, now seen corresponding path program 1 times [2022-04-27 15:44:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:44:19,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791152736] [2022-04-27 15:44:19,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:44:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:44:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:19,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:44:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:19,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {89813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {89806#true} is VALID [2022-04-27 15:44:19,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {89806#true} assume true; {89806#true} is VALID [2022-04-27 15:44:19,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89806#true} {89806#true} #720#return; {89806#true} is VALID [2022-04-27 15:44:19,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {89806#true} call ULTIMATE.init(); {89813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:44:19,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {89813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {89806#true} is VALID [2022-04-27 15:44:19,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {89806#true} assume true; {89806#true} is VALID [2022-04-27 15:44:19,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89806#true} {89806#true} #720#return; {89806#true} is VALID [2022-04-27 15:44:19,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {89806#true} call #t~ret161 := main(); {89806#true} is VALID [2022-04-27 15:44:19,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {89806#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {89806#true} is VALID [2022-04-27 15:44:19,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {89806#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,744 INFO L272 TraceCheckUtils]: 7: Hoare triple {89806#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {89806#true} is VALID [2022-04-27 15:44:19,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {89806#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {89806#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {89806#true} is VALID [2022-04-27 15:44:19,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {89806#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {89806#true} is VALID [2022-04-27 15:44:19,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {89806#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {89806#true} is VALID [2022-04-27 15:44:19,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {89806#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {89806#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {89806#true} is VALID [2022-04-27 15:44:19,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {89806#true} assume !false; {89806#true} is VALID [2022-04-27 15:44:19,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {89806#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {89806#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {89806#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {89806#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {89806#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {89806#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {89806#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {89806#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {89806#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {89806#true} assume 8464 == #t~mem55;havoc #t~mem55; {89806#true} is VALID [2022-04-27 15:44:19,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {89806#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {89806#true} is VALID [2022-04-27 15:44:19,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {89806#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {89806#true} is VALID [2022-04-27 15:44:19,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {89806#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {89806#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {89806#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {89806#true} is VALID [2022-04-27 15:44:19,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {89806#true} ~skip~0 := 0; {89806#true} is VALID [2022-04-27 15:44:19,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {89806#true} assume !false; {89806#true} is VALID [2022-04-27 15:44:19,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {89806#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {89806#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {89806#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {89806#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {89806#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,747 INFO L290 TraceCheckUtils]: 37: Hoare triple {89806#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,747 INFO L290 TraceCheckUtils]: 38: Hoare triple {89806#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,747 INFO L290 TraceCheckUtils]: 39: Hoare triple {89806#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,747 INFO L290 TraceCheckUtils]: 40: Hoare triple {89806#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {89806#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {89806#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {89806#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {89806#true} assume 8496 == #t~mem58;havoc #t~mem58; {89806#true} is VALID [2022-04-27 15:44:19,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {89806#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {89806#true} is VALID [2022-04-27 15:44:19,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {89806#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {89806#true} is VALID [2022-04-27 15:44:19,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {89806#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {89806#true} is VALID [2022-04-27 15:44:19,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {89806#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,750 INFO L290 TraceCheckUtils]: 50: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,751 INFO L290 TraceCheckUtils]: 52: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,751 INFO L290 TraceCheckUtils]: 53: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,752 INFO L290 TraceCheckUtils]: 54: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,752 INFO L290 TraceCheckUtils]: 55: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,754 INFO L290 TraceCheckUtils]: 58: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,754 INFO L290 TraceCheckUtils]: 59: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,754 INFO L290 TraceCheckUtils]: 60: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,755 INFO L290 TraceCheckUtils]: 61: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,755 INFO L290 TraceCheckUtils]: 62: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,756 INFO L290 TraceCheckUtils]: 63: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,756 INFO L290 TraceCheckUtils]: 64: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,757 INFO L290 TraceCheckUtils]: 65: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,757 INFO L290 TraceCheckUtils]: 66: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,758 INFO L290 TraceCheckUtils]: 67: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,758 INFO L290 TraceCheckUtils]: 68: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,758 INFO L290 TraceCheckUtils]: 69: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,759 INFO L290 TraceCheckUtils]: 70: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,759 INFO L290 TraceCheckUtils]: 71: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,760 INFO L290 TraceCheckUtils]: 72: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,760 INFO L290 TraceCheckUtils]: 73: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,761 INFO L290 TraceCheckUtils]: 74: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,761 INFO L290 TraceCheckUtils]: 75: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:19,762 INFO L290 TraceCheckUtils]: 76: Hoare triple {89811#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {89812#(not (= 8576 |ssl3_accept_#t~mem69|))} is VALID [2022-04-27 15:44:19,762 INFO L290 TraceCheckUtils]: 77: Hoare triple {89812#(not (= 8576 |ssl3_accept_#t~mem69|))} assume 8576 == #t~mem69;havoc #t~mem69; {89807#false} is VALID [2022-04-27 15:44:19,762 INFO L290 TraceCheckUtils]: 78: Hoare triple {89807#false} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {89807#false} is VALID [2022-04-27 15:44:19,762 INFO L290 TraceCheckUtils]: 79: Hoare triple {89807#false} assume !(5 == ~blastFlag~0); {89807#false} is VALID [2022-04-27 15:44:19,762 INFO L290 TraceCheckUtils]: 80: Hoare triple {89807#false} assume !(~ret~0 <= 0); {89807#false} is VALID [2022-04-27 15:44:19,762 INFO L290 TraceCheckUtils]: 81: Hoare triple {89807#false} assume 2 == ~ret~0;call write~int(8466, ~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,762 INFO L290 TraceCheckUtils]: 82: Hoare triple {89807#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,763 INFO L290 TraceCheckUtils]: 83: Hoare triple {89807#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {89807#false} is VALID [2022-04-27 15:44:19,763 INFO L290 TraceCheckUtils]: 84: Hoare triple {89807#false} ~skip~0 := 0; {89807#false} is VALID [2022-04-27 15:44:19,763 INFO L290 TraceCheckUtils]: 85: Hoare triple {89807#false} assume !false; {89807#false} is VALID [2022-04-27 15:44:19,763 INFO L290 TraceCheckUtils]: 86: Hoare triple {89807#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,763 INFO L290 TraceCheckUtils]: 87: Hoare triple {89807#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,763 INFO L290 TraceCheckUtils]: 88: Hoare triple {89807#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,763 INFO L290 TraceCheckUtils]: 89: Hoare triple {89807#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,763 INFO L290 TraceCheckUtils]: 90: Hoare triple {89807#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,763 INFO L290 TraceCheckUtils]: 91: Hoare triple {89807#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,763 INFO L290 TraceCheckUtils]: 92: Hoare triple {89807#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,763 INFO L290 TraceCheckUtils]: 93: Hoare triple {89807#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,763 INFO L290 TraceCheckUtils]: 94: Hoare triple {89807#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,764 INFO L290 TraceCheckUtils]: 95: Hoare triple {89807#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,764 INFO L290 TraceCheckUtils]: 96: Hoare triple {89807#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,764 INFO L290 TraceCheckUtils]: 97: Hoare triple {89807#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,764 INFO L290 TraceCheckUtils]: 98: Hoare triple {89807#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,764 INFO L290 TraceCheckUtils]: 99: Hoare triple {89807#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,764 INFO L290 TraceCheckUtils]: 100: Hoare triple {89807#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,764 INFO L290 TraceCheckUtils]: 101: Hoare triple {89807#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,764 INFO L290 TraceCheckUtils]: 102: Hoare triple {89807#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,764 INFO L290 TraceCheckUtils]: 103: Hoare triple {89807#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,764 INFO L290 TraceCheckUtils]: 104: Hoare triple {89807#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,764 INFO L290 TraceCheckUtils]: 105: Hoare triple {89807#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,764 INFO L290 TraceCheckUtils]: 106: Hoare triple {89807#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,764 INFO L290 TraceCheckUtils]: 107: Hoare triple {89807#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,765 INFO L290 TraceCheckUtils]: 108: Hoare triple {89807#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,765 INFO L290 TraceCheckUtils]: 109: Hoare triple {89807#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,765 INFO L290 TraceCheckUtils]: 110: Hoare triple {89807#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,765 INFO L290 TraceCheckUtils]: 111: Hoare triple {89807#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,765 INFO L290 TraceCheckUtils]: 112: Hoare triple {89807#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,765 INFO L290 TraceCheckUtils]: 113: Hoare triple {89807#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,765 INFO L290 TraceCheckUtils]: 114: Hoare triple {89807#false} assume 8609 == #t~mem74;havoc #t~mem74; {89807#false} is VALID [2022-04-27 15:44:19,765 INFO L290 TraceCheckUtils]: 115: Hoare triple {89807#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {89807#false} is VALID [2022-04-27 15:44:19,765 INFO L290 TraceCheckUtils]: 116: Hoare triple {89807#false} assume !(8 == ~blastFlag~0); {89807#false} is VALID [2022-04-27 15:44:19,765 INFO L290 TraceCheckUtils]: 117: Hoare triple {89807#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,765 INFO L290 TraceCheckUtils]: 118: Hoare triple {89807#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,765 INFO L290 TraceCheckUtils]: 119: Hoare triple {89807#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {89807#false} is VALID [2022-04-27 15:44:19,765 INFO L290 TraceCheckUtils]: 120: Hoare triple {89807#false} ~skip~0 := 0; {89807#false} is VALID [2022-04-27 15:44:19,766 INFO L290 TraceCheckUtils]: 121: Hoare triple {89807#false} assume !false; {89807#false} is VALID [2022-04-27 15:44:19,766 INFO L290 TraceCheckUtils]: 122: Hoare triple {89807#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,766 INFO L290 TraceCheckUtils]: 123: Hoare triple {89807#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,766 INFO L290 TraceCheckUtils]: 124: Hoare triple {89807#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,766 INFO L290 TraceCheckUtils]: 125: Hoare triple {89807#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,766 INFO L290 TraceCheckUtils]: 126: Hoare triple {89807#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,766 INFO L290 TraceCheckUtils]: 127: Hoare triple {89807#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,766 INFO L290 TraceCheckUtils]: 128: Hoare triple {89807#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,766 INFO L290 TraceCheckUtils]: 129: Hoare triple {89807#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,766 INFO L290 TraceCheckUtils]: 130: Hoare triple {89807#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,766 INFO L290 TraceCheckUtils]: 131: Hoare triple {89807#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,767 INFO L290 TraceCheckUtils]: 132: Hoare triple {89807#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,767 INFO L290 TraceCheckUtils]: 133: Hoare triple {89807#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,767 INFO L290 TraceCheckUtils]: 134: Hoare triple {89807#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,767 INFO L290 TraceCheckUtils]: 135: Hoare triple {89807#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,767 INFO L290 TraceCheckUtils]: 136: Hoare triple {89807#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,767 INFO L290 TraceCheckUtils]: 137: Hoare triple {89807#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,767 INFO L290 TraceCheckUtils]: 138: Hoare triple {89807#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,767 INFO L290 TraceCheckUtils]: 139: Hoare triple {89807#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,767 INFO L290 TraceCheckUtils]: 140: Hoare triple {89807#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,767 INFO L290 TraceCheckUtils]: 141: Hoare triple {89807#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,767 INFO L290 TraceCheckUtils]: 142: Hoare triple {89807#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,767 INFO L290 TraceCheckUtils]: 143: Hoare triple {89807#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,768 INFO L290 TraceCheckUtils]: 144: Hoare triple {89807#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,768 INFO L290 TraceCheckUtils]: 145: Hoare triple {89807#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,768 INFO L290 TraceCheckUtils]: 146: Hoare triple {89807#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,768 INFO L290 TraceCheckUtils]: 147: Hoare triple {89807#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,768 INFO L290 TraceCheckUtils]: 148: Hoare triple {89807#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,768 INFO L290 TraceCheckUtils]: 149: Hoare triple {89807#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,768 INFO L290 TraceCheckUtils]: 150: Hoare triple {89807#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {89807#false} is VALID [2022-04-27 15:44:19,768 INFO L290 TraceCheckUtils]: 151: Hoare triple {89807#false} assume 8640 == #t~mem75;havoc #t~mem75; {89807#false} is VALID [2022-04-27 15:44:19,768 INFO L290 TraceCheckUtils]: 152: Hoare triple {89807#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {89807#false} is VALID [2022-04-27 15:44:19,768 INFO L290 TraceCheckUtils]: 153: Hoare triple {89807#false} assume !(9 == ~blastFlag~0); {89807#false} is VALID [2022-04-27 15:44:19,768 INFO L290 TraceCheckUtils]: 154: Hoare triple {89807#false} assume !(12 == ~blastFlag~0); {89807#false} is VALID [2022-04-27 15:44:19,768 INFO L290 TraceCheckUtils]: 155: Hoare triple {89807#false} assume !false; {89807#false} is VALID [2022-04-27 15:44:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 15:44:19,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:44:19,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791152736] [2022-04-27 15:44:19,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791152736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:44:19,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:44:19,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:44:19,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228660384] [2022-04-27 15:44:19,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:44:19,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-27 15:44:19,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:44:19,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:19,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:19,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:44:19,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:44:19,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:44:19,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:44:19,867 INFO L87 Difference]: Start difference. First operand 1041 states and 1498 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:25,636 INFO L93 Difference]: Finished difference Result 2273 states and 3274 transitions. [2022-04-27 15:44:25,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:44:25,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-27 15:44:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:44:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2022-04-27 15:44:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2022-04-27 15:44:25,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 601 transitions. [2022-04-27 15:44:26,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 601 edges. 601 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:26,076 INFO L225 Difference]: With dead ends: 2273 [2022-04-27 15:44:26,076 INFO L226 Difference]: Without dead ends: 1258 [2022-04-27 15:44:26,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:44:26,077 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 123 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:44:26,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 396 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:44:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2022-04-27 15:44:26,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1107. [2022-04-27 15:44:26,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:44:26,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1258 states. Second operand has 1107 states, 1102 states have (on average 1.4355716878402904) internal successors, (1582), 1102 states have internal predecessors, (1582), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:26,093 INFO L74 IsIncluded]: Start isIncluded. First operand 1258 states. Second operand has 1107 states, 1102 states have (on average 1.4355716878402904) internal successors, (1582), 1102 states have internal predecessors, (1582), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:26,093 INFO L87 Difference]: Start difference. First operand 1258 states. Second operand has 1107 states, 1102 states have (on average 1.4355716878402904) internal successors, (1582), 1102 states have internal predecessors, (1582), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:26,142 INFO L93 Difference]: Finished difference Result 1258 states and 1798 transitions. [2022-04-27 15:44:26,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1798 transitions. [2022-04-27 15:44:26,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:26,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:26,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 1107 states, 1102 states have (on average 1.4355716878402904) internal successors, (1582), 1102 states have internal predecessors, (1582), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1258 states. [2022-04-27 15:44:26,144 INFO L87 Difference]: Start difference. First operand has 1107 states, 1102 states have (on average 1.4355716878402904) internal successors, (1582), 1102 states have internal predecessors, (1582), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1258 states. [2022-04-27 15:44:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:26,181 INFO L93 Difference]: Finished difference Result 1258 states and 1798 transitions. [2022-04-27 15:44:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1798 transitions. [2022-04-27 15:44:26,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:26,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:26,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:44:26,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:44:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1102 states have (on average 1.4355716878402904) internal successors, (1582), 1102 states have internal predecessors, (1582), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1586 transitions. [2022-04-27 15:44:26,215 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1586 transitions. Word has length 156 [2022-04-27 15:44:26,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:44:26,215 INFO L495 AbstractCegarLoop]: Abstraction has 1107 states and 1586 transitions. [2022-04-27 15:44:26,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1586 transitions. [2022-04-27 15:44:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-27 15:44:26,216 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:44:26,217 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:44:26,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-27 15:44:26,217 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:44:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:44:26,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2007955217, now seen corresponding path program 1 times [2022-04-27 15:44:26,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:44:26,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523827395] [2022-04-27 15:44:26,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:44:26,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:44:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:26,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:44:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:26,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {96063#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {96056#true} is VALID [2022-04-27 15:44:26,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {96056#true} assume true; {96056#true} is VALID [2022-04-27 15:44:26,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96056#true} {96056#true} #720#return; {96056#true} is VALID [2022-04-27 15:44:26,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {96056#true} call ULTIMATE.init(); {96063#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:44:26,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {96063#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {96056#true} is VALID [2022-04-27 15:44:26,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {96056#true} assume true; {96056#true} is VALID [2022-04-27 15:44:26,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96056#true} {96056#true} #720#return; {96056#true} is VALID [2022-04-27 15:44:26,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {96056#true} call #t~ret161 := main(); {96056#true} is VALID [2022-04-27 15:44:26,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {96056#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {96056#true} is VALID [2022-04-27 15:44:26,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {96056#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,348 INFO L272 TraceCheckUtils]: 7: Hoare triple {96056#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {96056#true} is VALID [2022-04-27 15:44:26,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {96056#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {96056#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {96056#true} is VALID [2022-04-27 15:44:26,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {96056#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {96056#true} is VALID [2022-04-27 15:44:26,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {96056#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {96056#true} is VALID [2022-04-27 15:44:26,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {96056#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {96056#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {96056#true} is VALID [2022-04-27 15:44:26,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {96056#true} assume !false; {96056#true} is VALID [2022-04-27 15:44:26,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {96056#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {96056#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {96056#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {96056#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {96056#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {96056#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {96056#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {96056#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {96056#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {96056#true} assume 8464 == #t~mem55;havoc #t~mem55; {96056#true} is VALID [2022-04-27 15:44:26,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {96056#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {96056#true} is VALID [2022-04-27 15:44:26,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {96056#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {96056#true} is VALID [2022-04-27 15:44:26,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {96056#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {96056#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {96056#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96056#true} is VALID [2022-04-27 15:44:26,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {96056#true} ~skip~0 := 0; {96056#true} is VALID [2022-04-27 15:44:26,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {96056#true} assume !false; {96056#true} is VALID [2022-04-27 15:44:26,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {96056#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,350 INFO L290 TraceCheckUtils]: 33: Hoare triple {96056#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,350 INFO L290 TraceCheckUtils]: 34: Hoare triple {96056#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {96056#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {96056#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {96056#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {96056#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {96056#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,351 INFO L290 TraceCheckUtils]: 40: Hoare triple {96056#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,351 INFO L290 TraceCheckUtils]: 41: Hoare triple {96056#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,351 INFO L290 TraceCheckUtils]: 42: Hoare triple {96056#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,351 INFO L290 TraceCheckUtils]: 43: Hoare triple {96056#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,351 INFO L290 TraceCheckUtils]: 44: Hoare triple {96056#true} assume 8496 == #t~mem58;havoc #t~mem58; {96056#true} is VALID [2022-04-27 15:44:26,351 INFO L290 TraceCheckUtils]: 45: Hoare triple {96056#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {96056#true} is VALID [2022-04-27 15:44:26,351 INFO L290 TraceCheckUtils]: 46: Hoare triple {96056#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {96056#true} is VALID [2022-04-27 15:44:26,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {96056#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {96056#true} is VALID [2022-04-27 15:44:26,352 INFO L290 TraceCheckUtils]: 48: Hoare triple {96056#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,353 INFO L290 TraceCheckUtils]: 49: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,353 INFO L290 TraceCheckUtils]: 50: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,354 INFO L290 TraceCheckUtils]: 51: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,354 INFO L290 TraceCheckUtils]: 52: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,354 INFO L290 TraceCheckUtils]: 53: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,355 INFO L290 TraceCheckUtils]: 54: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,355 INFO L290 TraceCheckUtils]: 55: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,356 INFO L290 TraceCheckUtils]: 56: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,356 INFO L290 TraceCheckUtils]: 57: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,356 INFO L290 TraceCheckUtils]: 58: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,357 INFO L290 TraceCheckUtils]: 59: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,357 INFO L290 TraceCheckUtils]: 60: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,358 INFO L290 TraceCheckUtils]: 61: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,358 INFO L290 TraceCheckUtils]: 62: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,358 INFO L290 TraceCheckUtils]: 63: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,359 INFO L290 TraceCheckUtils]: 64: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,359 INFO L290 TraceCheckUtils]: 65: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,360 INFO L290 TraceCheckUtils]: 66: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,360 INFO L290 TraceCheckUtils]: 67: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,360 INFO L290 TraceCheckUtils]: 68: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,361 INFO L290 TraceCheckUtils]: 69: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,361 INFO L290 TraceCheckUtils]: 70: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,362 INFO L290 TraceCheckUtils]: 71: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,362 INFO L290 TraceCheckUtils]: 72: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,362 INFO L290 TraceCheckUtils]: 73: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,363 INFO L290 TraceCheckUtils]: 74: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,363 INFO L290 TraceCheckUtils]: 75: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,364 INFO L290 TraceCheckUtils]: 76: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,364 INFO L290 TraceCheckUtils]: 77: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:26,364 INFO L290 TraceCheckUtils]: 78: Hoare triple {96061#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {96062#(not (= |ssl3_accept_#t~mem71| 8592))} is VALID [2022-04-27 15:44:26,365 INFO L290 TraceCheckUtils]: 79: Hoare triple {96062#(not (= |ssl3_accept_#t~mem71| 8592))} assume 8592 == #t~mem71;havoc #t~mem71; {96057#false} is VALID [2022-04-27 15:44:26,365 INFO L290 TraceCheckUtils]: 80: Hoare triple {96057#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {96057#false} is VALID [2022-04-27 15:44:26,365 INFO L290 TraceCheckUtils]: 81: Hoare triple {96057#false} assume !(7 == ~blastFlag~0); {96057#false} is VALID [2022-04-27 15:44:26,365 INFO L290 TraceCheckUtils]: 82: Hoare triple {96057#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,365 INFO L290 TraceCheckUtils]: 83: Hoare triple {96057#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,365 INFO L290 TraceCheckUtils]: 84: Hoare triple {96057#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96057#false} is VALID [2022-04-27 15:44:26,365 INFO L290 TraceCheckUtils]: 85: Hoare triple {96057#false} ~skip~0 := 0; {96057#false} is VALID [2022-04-27 15:44:26,365 INFO L290 TraceCheckUtils]: 86: Hoare triple {96057#false} assume !false; {96057#false} is VALID [2022-04-27 15:44:26,365 INFO L290 TraceCheckUtils]: 87: Hoare triple {96057#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,365 INFO L290 TraceCheckUtils]: 88: Hoare triple {96057#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,366 INFO L290 TraceCheckUtils]: 89: Hoare triple {96057#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,366 INFO L290 TraceCheckUtils]: 90: Hoare triple {96057#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,366 INFO L290 TraceCheckUtils]: 91: Hoare triple {96057#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,366 INFO L290 TraceCheckUtils]: 92: Hoare triple {96057#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,366 INFO L290 TraceCheckUtils]: 93: Hoare triple {96057#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,366 INFO L290 TraceCheckUtils]: 94: Hoare triple {96057#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,366 INFO L290 TraceCheckUtils]: 95: Hoare triple {96057#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,366 INFO L290 TraceCheckUtils]: 96: Hoare triple {96057#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,366 INFO L290 TraceCheckUtils]: 97: Hoare triple {96057#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,366 INFO L290 TraceCheckUtils]: 98: Hoare triple {96057#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,366 INFO L290 TraceCheckUtils]: 99: Hoare triple {96057#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,366 INFO L290 TraceCheckUtils]: 100: Hoare triple {96057#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,366 INFO L290 TraceCheckUtils]: 101: Hoare triple {96057#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,367 INFO L290 TraceCheckUtils]: 102: Hoare triple {96057#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,367 INFO L290 TraceCheckUtils]: 103: Hoare triple {96057#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,367 INFO L290 TraceCheckUtils]: 104: Hoare triple {96057#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,367 INFO L290 TraceCheckUtils]: 105: Hoare triple {96057#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,367 INFO L290 TraceCheckUtils]: 106: Hoare triple {96057#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,367 INFO L290 TraceCheckUtils]: 107: Hoare triple {96057#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,367 INFO L290 TraceCheckUtils]: 108: Hoare triple {96057#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,367 INFO L290 TraceCheckUtils]: 109: Hoare triple {96057#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,367 INFO L290 TraceCheckUtils]: 110: Hoare triple {96057#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,367 INFO L290 TraceCheckUtils]: 111: Hoare triple {96057#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,367 INFO L290 TraceCheckUtils]: 112: Hoare triple {96057#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,367 INFO L290 TraceCheckUtils]: 113: Hoare triple {96057#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,368 INFO L290 TraceCheckUtils]: 114: Hoare triple {96057#false} assume 8608 == #t~mem73;havoc #t~mem73; {96057#false} is VALID [2022-04-27 15:44:26,368 INFO L290 TraceCheckUtils]: 115: Hoare triple {96057#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {96057#false} is VALID [2022-04-27 15:44:26,368 INFO L290 TraceCheckUtils]: 116: Hoare triple {96057#false} assume !(8 == ~blastFlag~0); {96057#false} is VALID [2022-04-27 15:44:26,368 INFO L290 TraceCheckUtils]: 117: Hoare triple {96057#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,368 INFO L290 TraceCheckUtils]: 118: Hoare triple {96057#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,368 INFO L290 TraceCheckUtils]: 119: Hoare triple {96057#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96057#false} is VALID [2022-04-27 15:44:26,368 INFO L290 TraceCheckUtils]: 120: Hoare triple {96057#false} ~skip~0 := 0; {96057#false} is VALID [2022-04-27 15:44:26,368 INFO L290 TraceCheckUtils]: 121: Hoare triple {96057#false} assume !false; {96057#false} is VALID [2022-04-27 15:44:26,368 INFO L290 TraceCheckUtils]: 122: Hoare triple {96057#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,368 INFO L290 TraceCheckUtils]: 123: Hoare triple {96057#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,368 INFO L290 TraceCheckUtils]: 124: Hoare triple {96057#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,368 INFO L290 TraceCheckUtils]: 125: Hoare triple {96057#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,368 INFO L290 TraceCheckUtils]: 126: Hoare triple {96057#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,369 INFO L290 TraceCheckUtils]: 127: Hoare triple {96057#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,369 INFO L290 TraceCheckUtils]: 128: Hoare triple {96057#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,369 INFO L290 TraceCheckUtils]: 129: Hoare triple {96057#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,369 INFO L290 TraceCheckUtils]: 130: Hoare triple {96057#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,369 INFO L290 TraceCheckUtils]: 131: Hoare triple {96057#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,369 INFO L290 TraceCheckUtils]: 132: Hoare triple {96057#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,369 INFO L290 TraceCheckUtils]: 133: Hoare triple {96057#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,369 INFO L290 TraceCheckUtils]: 134: Hoare triple {96057#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,369 INFO L290 TraceCheckUtils]: 135: Hoare triple {96057#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,369 INFO L290 TraceCheckUtils]: 136: Hoare triple {96057#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,369 INFO L290 TraceCheckUtils]: 137: Hoare triple {96057#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,369 INFO L290 TraceCheckUtils]: 138: Hoare triple {96057#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,370 INFO L290 TraceCheckUtils]: 139: Hoare triple {96057#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,370 INFO L290 TraceCheckUtils]: 140: Hoare triple {96057#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,370 INFO L290 TraceCheckUtils]: 141: Hoare triple {96057#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,370 INFO L290 TraceCheckUtils]: 142: Hoare triple {96057#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,370 INFO L290 TraceCheckUtils]: 143: Hoare triple {96057#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,370 INFO L290 TraceCheckUtils]: 144: Hoare triple {96057#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,370 INFO L290 TraceCheckUtils]: 145: Hoare triple {96057#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,370 INFO L290 TraceCheckUtils]: 146: Hoare triple {96057#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,370 INFO L290 TraceCheckUtils]: 147: Hoare triple {96057#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,370 INFO L290 TraceCheckUtils]: 148: Hoare triple {96057#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,370 INFO L290 TraceCheckUtils]: 149: Hoare triple {96057#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,370 INFO L290 TraceCheckUtils]: 150: Hoare triple {96057#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {96057#false} is VALID [2022-04-27 15:44:26,370 INFO L290 TraceCheckUtils]: 151: Hoare triple {96057#false} assume 8640 == #t~mem75;havoc #t~mem75; {96057#false} is VALID [2022-04-27 15:44:26,371 INFO L290 TraceCheckUtils]: 152: Hoare triple {96057#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {96057#false} is VALID [2022-04-27 15:44:26,371 INFO L290 TraceCheckUtils]: 153: Hoare triple {96057#false} assume !(9 == ~blastFlag~0); {96057#false} is VALID [2022-04-27 15:44:26,371 INFO L290 TraceCheckUtils]: 154: Hoare triple {96057#false} assume !(12 == ~blastFlag~0); {96057#false} is VALID [2022-04-27 15:44:26,371 INFO L290 TraceCheckUtils]: 155: Hoare triple {96057#false} assume !false; {96057#false} is VALID [2022-04-27 15:44:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-27 15:44:26,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:44:26,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523827395] [2022-04-27 15:44:26,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523827395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:44:26,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:44:26,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:44:26,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855961364] [2022-04-27 15:44:26,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:44:26,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-27 15:44:26,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:44:26,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:26,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:26,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:44:26,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:44:26,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:44:26,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:44:26,454 INFO L87 Difference]: Start difference. First operand 1107 states and 1586 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:27,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:44:33,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:44:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:34,192 INFO L93 Difference]: Finished difference Result 2405 states and 3446 transitions. [2022-04-27 15:44:34,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:44:34,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-27 15:44:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:44:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2022-04-27 15:44:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2022-04-27 15:44:34,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 601 transitions. [2022-04-27 15:44:34,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 601 edges. 601 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:34,636 INFO L225 Difference]: With dead ends: 2405 [2022-04-27 15:44:34,636 INFO L226 Difference]: Without dead ends: 1324 [2022-04-27 15:44:34,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:44:34,637 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 121 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:44:34,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 396 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-27 15:44:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2022-04-27 15:44:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1177. [2022-04-27 15:44:34,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:44:34,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1324 states. Second operand has 1177 states, 1172 states have (on average 1.4283276450511946) internal successors, (1674), 1172 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:34,664 INFO L74 IsIncluded]: Start isIncluded. First operand 1324 states. Second operand has 1177 states, 1172 states have (on average 1.4283276450511946) internal successors, (1674), 1172 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:34,665 INFO L87 Difference]: Start difference. First operand 1324 states. Second operand has 1177 states, 1172 states have (on average 1.4283276450511946) internal successors, (1674), 1172 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:34,706 INFO L93 Difference]: Finished difference Result 1324 states and 1882 transitions. [2022-04-27 15:44:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1882 transitions. [2022-04-27 15:44:34,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:34,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:34,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 1172 states have (on average 1.4283276450511946) internal successors, (1674), 1172 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1324 states. [2022-04-27 15:44:34,708 INFO L87 Difference]: Start difference. First operand has 1177 states, 1172 states have (on average 1.4283276450511946) internal successors, (1674), 1172 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1324 states. [2022-04-27 15:44:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:34,748 INFO L93 Difference]: Finished difference Result 1324 states and 1882 transitions. [2022-04-27 15:44:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1882 transitions. [2022-04-27 15:44:34,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:34,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:34,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:44:34,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:44:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1172 states have (on average 1.4283276450511946) internal successors, (1674), 1172 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1678 transitions. [2022-04-27 15:44:34,786 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1678 transitions. Word has length 156 [2022-04-27 15:44:34,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:44:34,786 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1678 transitions. [2022-04-27 15:44:34,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1678 transitions. [2022-04-27 15:44:34,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-27 15:44:34,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:44:34,788 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:44:34,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-27 15:44:34,788 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:44:34,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:44:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1104547800, now seen corresponding path program 1 times [2022-04-27 15:44:34,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:44:34,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107887868] [2022-04-27 15:44:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:44:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:44:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:34,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:44:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:34,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {102659#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {102652#true} is VALID [2022-04-27 15:44:34,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {102652#true} assume true; {102652#true} is VALID [2022-04-27 15:44:34,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {102652#true} {102652#true} #720#return; {102652#true} is VALID [2022-04-27 15:44:34,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {102652#true} call ULTIMATE.init(); {102659#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:44:34,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {102659#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {102652#true} is VALID [2022-04-27 15:44:34,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {102652#true} assume true; {102652#true} is VALID [2022-04-27 15:44:34,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102652#true} {102652#true} #720#return; {102652#true} is VALID [2022-04-27 15:44:34,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {102652#true} call #t~ret161 := main(); {102652#true} is VALID [2022-04-27 15:44:34,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {102652#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {102652#true} is VALID [2022-04-27 15:44:34,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {102652#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,911 INFO L272 TraceCheckUtils]: 7: Hoare triple {102652#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {102652#true} is VALID [2022-04-27 15:44:34,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {102652#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {102652#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {102652#true} is VALID [2022-04-27 15:44:34,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {102652#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {102652#true} is VALID [2022-04-27 15:44:34,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {102652#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {102652#true} is VALID [2022-04-27 15:44:34,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {102652#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {102652#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {102652#true} is VALID [2022-04-27 15:44:34,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {102652#true} assume !false; {102652#true} is VALID [2022-04-27 15:44:34,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {102652#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {102652#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {102652#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {102652#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {102652#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {102652#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {102652#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {102652#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {102652#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {102652#true} assume 8464 == #t~mem55;havoc #t~mem55; {102652#true} is VALID [2022-04-27 15:44:34,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {102652#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {102652#true} is VALID [2022-04-27 15:44:34,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {102652#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {102652#true} is VALID [2022-04-27 15:44:34,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {102652#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {102652#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {102652#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {102652#true} is VALID [2022-04-27 15:44:34,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {102652#true} ~skip~0 := 0; {102652#true} is VALID [2022-04-27 15:44:34,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {102652#true} assume !false; {102652#true} is VALID [2022-04-27 15:44:34,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {102652#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {102652#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {102652#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {102652#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,914 INFO L290 TraceCheckUtils]: 36: Hoare triple {102652#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,914 INFO L290 TraceCheckUtils]: 37: Hoare triple {102652#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {102652#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {102652#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {102652#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {102652#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {102652#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {102652#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {102652#true} assume 8496 == #t~mem58;havoc #t~mem58; {102652#true} is VALID [2022-04-27 15:44:34,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {102652#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {102652#true} is VALID [2022-04-27 15:44:34,915 INFO L290 TraceCheckUtils]: 46: Hoare triple {102652#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {102652#true} is VALID [2022-04-27 15:44:34,915 INFO L290 TraceCheckUtils]: 47: Hoare triple {102652#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {102652#true} is VALID [2022-04-27 15:44:34,916 INFO L290 TraceCheckUtils]: 48: Hoare triple {102652#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,917 INFO L290 TraceCheckUtils]: 49: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,917 INFO L290 TraceCheckUtils]: 50: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,918 INFO L290 TraceCheckUtils]: 51: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,918 INFO L290 TraceCheckUtils]: 52: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,918 INFO L290 TraceCheckUtils]: 53: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,919 INFO L290 TraceCheckUtils]: 54: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,919 INFO L290 TraceCheckUtils]: 55: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,920 INFO L290 TraceCheckUtils]: 56: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,920 INFO L290 TraceCheckUtils]: 57: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,921 INFO L290 TraceCheckUtils]: 58: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,921 INFO L290 TraceCheckUtils]: 59: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,921 INFO L290 TraceCheckUtils]: 60: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,923 INFO L290 TraceCheckUtils]: 64: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,923 INFO L290 TraceCheckUtils]: 65: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,924 INFO L290 TraceCheckUtils]: 66: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,924 INFO L290 TraceCheckUtils]: 67: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,925 INFO L290 TraceCheckUtils]: 68: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,925 INFO L290 TraceCheckUtils]: 70: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,926 INFO L290 TraceCheckUtils]: 71: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,926 INFO L290 TraceCheckUtils]: 72: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,927 INFO L290 TraceCheckUtils]: 73: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,927 INFO L290 TraceCheckUtils]: 74: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,927 INFO L290 TraceCheckUtils]: 75: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,928 INFO L290 TraceCheckUtils]: 76: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:44:34,928 INFO L290 TraceCheckUtils]: 77: Hoare triple {102657#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {102658#(not (= |ssl3_accept_#t~mem70| 8577))} is VALID [2022-04-27 15:44:34,929 INFO L290 TraceCheckUtils]: 78: Hoare triple {102658#(not (= |ssl3_accept_#t~mem70| 8577))} assume 8577 == #t~mem70;havoc #t~mem70; {102653#false} is VALID [2022-04-27 15:44:34,929 INFO L290 TraceCheckUtils]: 79: Hoare triple {102653#false} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {102653#false} is VALID [2022-04-27 15:44:34,929 INFO L290 TraceCheckUtils]: 80: Hoare triple {102653#false} assume !(5 == ~blastFlag~0); {102653#false} is VALID [2022-04-27 15:44:34,929 INFO L290 TraceCheckUtils]: 81: Hoare triple {102653#false} assume !(~ret~0 <= 0); {102653#false} is VALID [2022-04-27 15:44:34,929 INFO L290 TraceCheckUtils]: 82: Hoare triple {102653#false} assume 2 == ~ret~0;call write~int(8466, ~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,929 INFO L290 TraceCheckUtils]: 83: Hoare triple {102653#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,929 INFO L290 TraceCheckUtils]: 84: Hoare triple {102653#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {102653#false} is VALID [2022-04-27 15:44:34,929 INFO L290 TraceCheckUtils]: 85: Hoare triple {102653#false} ~skip~0 := 0; {102653#false} is VALID [2022-04-27 15:44:34,929 INFO L290 TraceCheckUtils]: 86: Hoare triple {102653#false} assume !false; {102653#false} is VALID [2022-04-27 15:44:34,929 INFO L290 TraceCheckUtils]: 87: Hoare triple {102653#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,929 INFO L290 TraceCheckUtils]: 88: Hoare triple {102653#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,929 INFO L290 TraceCheckUtils]: 89: Hoare triple {102653#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,930 INFO L290 TraceCheckUtils]: 90: Hoare triple {102653#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,930 INFO L290 TraceCheckUtils]: 91: Hoare triple {102653#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,930 INFO L290 TraceCheckUtils]: 92: Hoare triple {102653#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,930 INFO L290 TraceCheckUtils]: 93: Hoare triple {102653#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,930 INFO L290 TraceCheckUtils]: 94: Hoare triple {102653#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,930 INFO L290 TraceCheckUtils]: 95: Hoare triple {102653#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,930 INFO L290 TraceCheckUtils]: 96: Hoare triple {102653#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,930 INFO L290 TraceCheckUtils]: 97: Hoare triple {102653#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,930 INFO L290 TraceCheckUtils]: 98: Hoare triple {102653#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,930 INFO L290 TraceCheckUtils]: 99: Hoare triple {102653#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,930 INFO L290 TraceCheckUtils]: 100: Hoare triple {102653#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,930 INFO L290 TraceCheckUtils]: 101: Hoare triple {102653#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,931 INFO L290 TraceCheckUtils]: 102: Hoare triple {102653#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,931 INFO L290 TraceCheckUtils]: 103: Hoare triple {102653#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,931 INFO L290 TraceCheckUtils]: 104: Hoare triple {102653#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,931 INFO L290 TraceCheckUtils]: 105: Hoare triple {102653#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,931 INFO L290 TraceCheckUtils]: 106: Hoare triple {102653#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,931 INFO L290 TraceCheckUtils]: 107: Hoare triple {102653#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,931 INFO L290 TraceCheckUtils]: 108: Hoare triple {102653#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,931 INFO L290 TraceCheckUtils]: 109: Hoare triple {102653#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,931 INFO L290 TraceCheckUtils]: 110: Hoare triple {102653#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,931 INFO L290 TraceCheckUtils]: 111: Hoare triple {102653#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,931 INFO L290 TraceCheckUtils]: 112: Hoare triple {102653#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,931 INFO L290 TraceCheckUtils]: 113: Hoare triple {102653#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,932 INFO L290 TraceCheckUtils]: 114: Hoare triple {102653#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,932 INFO L290 TraceCheckUtils]: 115: Hoare triple {102653#false} assume 8609 == #t~mem74;havoc #t~mem74; {102653#false} is VALID [2022-04-27 15:44:34,932 INFO L290 TraceCheckUtils]: 116: Hoare triple {102653#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {102653#false} is VALID [2022-04-27 15:44:34,932 INFO L290 TraceCheckUtils]: 117: Hoare triple {102653#false} assume !(8 == ~blastFlag~0); {102653#false} is VALID [2022-04-27 15:44:34,932 INFO L290 TraceCheckUtils]: 118: Hoare triple {102653#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,932 INFO L290 TraceCheckUtils]: 119: Hoare triple {102653#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,932 INFO L290 TraceCheckUtils]: 120: Hoare triple {102653#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {102653#false} is VALID [2022-04-27 15:44:34,932 INFO L290 TraceCheckUtils]: 121: Hoare triple {102653#false} ~skip~0 := 0; {102653#false} is VALID [2022-04-27 15:44:34,932 INFO L290 TraceCheckUtils]: 122: Hoare triple {102653#false} assume !false; {102653#false} is VALID [2022-04-27 15:44:34,932 INFO L290 TraceCheckUtils]: 123: Hoare triple {102653#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,932 INFO L290 TraceCheckUtils]: 124: Hoare triple {102653#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,932 INFO L290 TraceCheckUtils]: 125: Hoare triple {102653#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,932 INFO L290 TraceCheckUtils]: 126: Hoare triple {102653#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,933 INFO L290 TraceCheckUtils]: 127: Hoare triple {102653#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,933 INFO L290 TraceCheckUtils]: 128: Hoare triple {102653#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,933 INFO L290 TraceCheckUtils]: 129: Hoare triple {102653#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,933 INFO L290 TraceCheckUtils]: 130: Hoare triple {102653#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,933 INFO L290 TraceCheckUtils]: 131: Hoare triple {102653#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,933 INFO L290 TraceCheckUtils]: 132: Hoare triple {102653#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,933 INFO L290 TraceCheckUtils]: 133: Hoare triple {102653#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,934 INFO L290 TraceCheckUtils]: 134: Hoare triple {102653#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,934 INFO L290 TraceCheckUtils]: 135: Hoare triple {102653#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,934 INFO L290 TraceCheckUtils]: 136: Hoare triple {102653#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,934 INFO L290 TraceCheckUtils]: 137: Hoare triple {102653#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,934 INFO L290 TraceCheckUtils]: 138: Hoare triple {102653#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,934 INFO L290 TraceCheckUtils]: 139: Hoare triple {102653#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,934 INFO L290 TraceCheckUtils]: 140: Hoare triple {102653#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,935 INFO L290 TraceCheckUtils]: 141: Hoare triple {102653#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,935 INFO L290 TraceCheckUtils]: 142: Hoare triple {102653#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,935 INFO L290 TraceCheckUtils]: 143: Hoare triple {102653#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,935 INFO L290 TraceCheckUtils]: 144: Hoare triple {102653#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,935 INFO L290 TraceCheckUtils]: 145: Hoare triple {102653#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,935 INFO L290 TraceCheckUtils]: 146: Hoare triple {102653#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,935 INFO L290 TraceCheckUtils]: 147: Hoare triple {102653#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,935 INFO L290 TraceCheckUtils]: 148: Hoare triple {102653#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,935 INFO L290 TraceCheckUtils]: 149: Hoare triple {102653#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,935 INFO L290 TraceCheckUtils]: 150: Hoare triple {102653#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,935 INFO L290 TraceCheckUtils]: 151: Hoare triple {102653#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {102653#false} is VALID [2022-04-27 15:44:34,935 INFO L290 TraceCheckUtils]: 152: Hoare triple {102653#false} assume 8640 == #t~mem75;havoc #t~mem75; {102653#false} is VALID [2022-04-27 15:44:34,936 INFO L290 TraceCheckUtils]: 153: Hoare triple {102653#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {102653#false} is VALID [2022-04-27 15:44:34,936 INFO L290 TraceCheckUtils]: 154: Hoare triple {102653#false} assume !(9 == ~blastFlag~0); {102653#false} is VALID [2022-04-27 15:44:34,936 INFO L290 TraceCheckUtils]: 155: Hoare triple {102653#false} assume !(12 == ~blastFlag~0); {102653#false} is VALID [2022-04-27 15:44:34,936 INFO L290 TraceCheckUtils]: 156: Hoare triple {102653#false} assume !false; {102653#false} is VALID [2022-04-27 15:44:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 15:44:34,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:44:34,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107887868] [2022-04-27 15:44:34,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107887868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:44:34,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:44:34,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:44:34,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257366719] [2022-04-27 15:44:34,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:44:34,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-27 15:44:34,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:44:34,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:35,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:35,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:44:35,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:44:35,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:44:35,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:44:35,030 INFO L87 Difference]: Start difference. First operand 1177 states and 1678 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:38,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:44:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:40,575 INFO L93 Difference]: Finished difference Result 2465 states and 3516 transitions. [2022-04-27 15:44:40,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:44:40,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-27 15:44:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:44:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2022-04-27 15:44:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2022-04-27 15:44:40,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 601 transitions. [2022-04-27 15:44:40,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 601 edges. 601 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:41,039 INFO L225 Difference]: With dead ends: 2465 [2022-04-27 15:44:41,039 INFO L226 Difference]: Without dead ends: 1314 [2022-04-27 15:44:41,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:44:41,041 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 122 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:44:41,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 398 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-27 15:44:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2022-04-27 15:44:41,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1177. [2022-04-27 15:44:41,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:44:41,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1314 states. Second operand has 1177 states, 1172 states have (on average 1.4197952218430034) internal successors, (1664), 1172 states have internal predecessors, (1664), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:41,070 INFO L74 IsIncluded]: Start isIncluded. First operand 1314 states. Second operand has 1177 states, 1172 states have (on average 1.4197952218430034) internal successors, (1664), 1172 states have internal predecessors, (1664), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:41,071 INFO L87 Difference]: Start difference. First operand 1314 states. Second operand has 1177 states, 1172 states have (on average 1.4197952218430034) internal successors, (1664), 1172 states have internal predecessors, (1664), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:41,114 INFO L93 Difference]: Finished difference Result 1314 states and 1858 transitions. [2022-04-27 15:44:41,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1858 transitions. [2022-04-27 15:44:41,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:41,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:41,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 1172 states have (on average 1.4197952218430034) internal successors, (1664), 1172 states have internal predecessors, (1664), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1314 states. [2022-04-27 15:44:41,116 INFO L87 Difference]: Start difference. First operand has 1177 states, 1172 states have (on average 1.4197952218430034) internal successors, (1664), 1172 states have internal predecessors, (1664), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1314 states. [2022-04-27 15:44:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:41,170 INFO L93 Difference]: Finished difference Result 1314 states and 1858 transitions. [2022-04-27 15:44:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1858 transitions. [2022-04-27 15:44:41,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:41,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:41,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:44:41,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:44:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1172 states have (on average 1.4197952218430034) internal successors, (1664), 1172 states have internal predecessors, (1664), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1668 transitions. [2022-04-27 15:44:41,207 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1668 transitions. Word has length 157 [2022-04-27 15:44:41,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:44:41,207 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1668 transitions. [2022-04-27 15:44:41,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1668 transitions. [2022-04-27 15:44:41,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-27 15:44:41,208 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:44:41,208 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-27 15:44:41,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-27 15:44:41,209 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:44:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:44:41,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1436608025, now seen corresponding path program 1 times [2022-04-27 15:44:41,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:44:41,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298854521] [2022-04-27 15:44:41,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:44:41,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:44:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:41,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:44:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:41,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {109299#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {109292#true} is VALID [2022-04-27 15:44:41,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {109292#true} assume true; {109292#true} is VALID [2022-04-27 15:44:41,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {109292#true} {109292#true} #720#return; {109292#true} is VALID [2022-04-27 15:44:41,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {109292#true} call ULTIMATE.init(); {109299#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:44:41,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {109299#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {109292#true} is VALID [2022-04-27 15:44:41,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {109292#true} assume true; {109292#true} is VALID [2022-04-27 15:44:41,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109292#true} {109292#true} #720#return; {109292#true} is VALID [2022-04-27 15:44:41,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {109292#true} call #t~ret161 := main(); {109292#true} is VALID [2022-04-27 15:44:41,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {109292#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {109292#true} is VALID [2022-04-27 15:44:41,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {109292#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,331 INFO L272 TraceCheckUtils]: 7: Hoare triple {109292#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {109292#true} is VALID [2022-04-27 15:44:41,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {109292#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {109292#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {109292#true} is VALID [2022-04-27 15:44:41,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {109292#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {109292#true} is VALID [2022-04-27 15:44:41,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {109292#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {109292#true} is VALID [2022-04-27 15:44:41,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {109292#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {109292#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {109292#true} is VALID [2022-04-27 15:44:41,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {109292#true} assume !false; {109292#true} is VALID [2022-04-27 15:44:41,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {109292#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {109292#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {109292#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {109292#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {109292#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {109292#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {109292#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {109292#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {109292#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {109292#true} assume 8464 == #t~mem55;havoc #t~mem55; {109292#true} is VALID [2022-04-27 15:44:41,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {109292#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {109292#true} is VALID [2022-04-27 15:44:41,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {109292#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {109292#true} is VALID [2022-04-27 15:44:41,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {109292#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {109292#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {109292#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109292#true} is VALID [2022-04-27 15:44:41,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {109292#true} ~skip~0 := 0; {109292#true} is VALID [2022-04-27 15:44:41,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {109292#true} assume !false; {109292#true} is VALID [2022-04-27 15:44:41,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {109292#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {109292#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {109292#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {109292#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {109292#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {109292#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {109292#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {109292#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {109292#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {109292#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {109292#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,334 INFO L290 TraceCheckUtils]: 43: Hoare triple {109292#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,334 INFO L290 TraceCheckUtils]: 44: Hoare triple {109292#true} assume 8496 == #t~mem58;havoc #t~mem58; {109292#true} is VALID [2022-04-27 15:44:41,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {109292#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {109292#true} is VALID [2022-04-27 15:44:41,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {109292#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {109292#true} is VALID [2022-04-27 15:44:41,335 INFO L290 TraceCheckUtils]: 47: Hoare triple {109292#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {109292#true} is VALID [2022-04-27 15:44:41,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {109292#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,338 INFO L290 TraceCheckUtils]: 54: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,338 INFO L290 TraceCheckUtils]: 55: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,339 INFO L290 TraceCheckUtils]: 56: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,340 INFO L290 TraceCheckUtils]: 59: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,340 INFO L290 TraceCheckUtils]: 60: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,341 INFO L290 TraceCheckUtils]: 61: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,341 INFO L290 TraceCheckUtils]: 62: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,341 INFO L290 TraceCheckUtils]: 63: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,342 INFO L290 TraceCheckUtils]: 64: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,342 INFO L290 TraceCheckUtils]: 65: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,343 INFO L290 TraceCheckUtils]: 66: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,343 INFO L290 TraceCheckUtils]: 67: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,343 INFO L290 TraceCheckUtils]: 68: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,344 INFO L290 TraceCheckUtils]: 69: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,344 INFO L290 TraceCheckUtils]: 70: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,345 INFO L290 TraceCheckUtils]: 71: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,345 INFO L290 TraceCheckUtils]: 72: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,345 INFO L290 TraceCheckUtils]: 73: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,346 INFO L290 TraceCheckUtils]: 74: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,346 INFO L290 TraceCheckUtils]: 75: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,347 INFO L290 TraceCheckUtils]: 76: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,347 INFO L290 TraceCheckUtils]: 77: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,347 INFO L290 TraceCheckUtils]: 78: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:41,348 INFO L290 TraceCheckUtils]: 79: Hoare triple {109297#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {109298#(= |ssl3_accept_#t~mem72| 8656)} is VALID [2022-04-27 15:44:41,348 INFO L290 TraceCheckUtils]: 80: Hoare triple {109298#(= |ssl3_accept_#t~mem72| 8656)} assume 8593 == #t~mem72;havoc #t~mem72; {109293#false} is VALID [2022-04-27 15:44:41,348 INFO L290 TraceCheckUtils]: 81: Hoare triple {109293#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {109293#false} is VALID [2022-04-27 15:44:41,348 INFO L290 TraceCheckUtils]: 82: Hoare triple {109293#false} assume !(7 == ~blastFlag~0); {109293#false} is VALID [2022-04-27 15:44:41,348 INFO L290 TraceCheckUtils]: 83: Hoare triple {109293#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,348 INFO L290 TraceCheckUtils]: 84: Hoare triple {109293#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,348 INFO L290 TraceCheckUtils]: 85: Hoare triple {109293#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109293#false} is VALID [2022-04-27 15:44:41,349 INFO L290 TraceCheckUtils]: 86: Hoare triple {109293#false} ~skip~0 := 0; {109293#false} is VALID [2022-04-27 15:44:41,349 INFO L290 TraceCheckUtils]: 87: Hoare triple {109293#false} assume !false; {109293#false} is VALID [2022-04-27 15:44:41,349 INFO L290 TraceCheckUtils]: 88: Hoare triple {109293#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,349 INFO L290 TraceCheckUtils]: 89: Hoare triple {109293#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,349 INFO L290 TraceCheckUtils]: 90: Hoare triple {109293#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,349 INFO L290 TraceCheckUtils]: 91: Hoare triple {109293#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,349 INFO L290 TraceCheckUtils]: 92: Hoare triple {109293#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,349 INFO L290 TraceCheckUtils]: 93: Hoare triple {109293#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,349 INFO L290 TraceCheckUtils]: 94: Hoare triple {109293#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,349 INFO L290 TraceCheckUtils]: 95: Hoare triple {109293#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,349 INFO L290 TraceCheckUtils]: 96: Hoare triple {109293#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,349 INFO L290 TraceCheckUtils]: 97: Hoare triple {109293#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,350 INFO L290 TraceCheckUtils]: 98: Hoare triple {109293#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,350 INFO L290 TraceCheckUtils]: 99: Hoare triple {109293#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,350 INFO L290 TraceCheckUtils]: 100: Hoare triple {109293#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,350 INFO L290 TraceCheckUtils]: 101: Hoare triple {109293#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,350 INFO L290 TraceCheckUtils]: 102: Hoare triple {109293#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,350 INFO L290 TraceCheckUtils]: 103: Hoare triple {109293#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,350 INFO L290 TraceCheckUtils]: 104: Hoare triple {109293#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,350 INFO L290 TraceCheckUtils]: 105: Hoare triple {109293#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,350 INFO L290 TraceCheckUtils]: 106: Hoare triple {109293#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,350 INFO L290 TraceCheckUtils]: 107: Hoare triple {109293#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,350 INFO L290 TraceCheckUtils]: 108: Hoare triple {109293#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,350 INFO L290 TraceCheckUtils]: 109: Hoare triple {109293#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,350 INFO L290 TraceCheckUtils]: 110: Hoare triple {109293#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,351 INFO L290 TraceCheckUtils]: 111: Hoare triple {109293#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,351 INFO L290 TraceCheckUtils]: 112: Hoare triple {109293#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,351 INFO L290 TraceCheckUtils]: 113: Hoare triple {109293#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,351 INFO L290 TraceCheckUtils]: 114: Hoare triple {109293#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,351 INFO L290 TraceCheckUtils]: 115: Hoare triple {109293#false} assume 8608 == #t~mem73;havoc #t~mem73; {109293#false} is VALID [2022-04-27 15:44:41,351 INFO L290 TraceCheckUtils]: 116: Hoare triple {109293#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {109293#false} is VALID [2022-04-27 15:44:41,351 INFO L290 TraceCheckUtils]: 117: Hoare triple {109293#false} assume !(8 == ~blastFlag~0); {109293#false} is VALID [2022-04-27 15:44:41,351 INFO L290 TraceCheckUtils]: 118: Hoare triple {109293#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,351 INFO L290 TraceCheckUtils]: 119: Hoare triple {109293#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,351 INFO L290 TraceCheckUtils]: 120: Hoare triple {109293#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109293#false} is VALID [2022-04-27 15:44:41,351 INFO L290 TraceCheckUtils]: 121: Hoare triple {109293#false} ~skip~0 := 0; {109293#false} is VALID [2022-04-27 15:44:41,351 INFO L290 TraceCheckUtils]: 122: Hoare triple {109293#false} assume !false; {109293#false} is VALID [2022-04-27 15:44:41,352 INFO L290 TraceCheckUtils]: 123: Hoare triple {109293#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,352 INFO L290 TraceCheckUtils]: 124: Hoare triple {109293#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,352 INFO L290 TraceCheckUtils]: 125: Hoare triple {109293#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,352 INFO L290 TraceCheckUtils]: 126: Hoare triple {109293#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,352 INFO L290 TraceCheckUtils]: 127: Hoare triple {109293#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,352 INFO L290 TraceCheckUtils]: 128: Hoare triple {109293#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,352 INFO L290 TraceCheckUtils]: 129: Hoare triple {109293#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,352 INFO L290 TraceCheckUtils]: 130: Hoare triple {109293#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,352 INFO L290 TraceCheckUtils]: 131: Hoare triple {109293#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,352 INFO L290 TraceCheckUtils]: 132: Hoare triple {109293#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,352 INFO L290 TraceCheckUtils]: 133: Hoare triple {109293#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,352 INFO L290 TraceCheckUtils]: 134: Hoare triple {109293#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,352 INFO L290 TraceCheckUtils]: 135: Hoare triple {109293#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,353 INFO L290 TraceCheckUtils]: 136: Hoare triple {109293#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,353 INFO L290 TraceCheckUtils]: 137: Hoare triple {109293#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,353 INFO L290 TraceCheckUtils]: 138: Hoare triple {109293#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,353 INFO L290 TraceCheckUtils]: 139: Hoare triple {109293#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,353 INFO L290 TraceCheckUtils]: 140: Hoare triple {109293#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,353 INFO L290 TraceCheckUtils]: 141: Hoare triple {109293#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,353 INFO L290 TraceCheckUtils]: 142: Hoare triple {109293#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,353 INFO L290 TraceCheckUtils]: 143: Hoare triple {109293#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,353 INFO L290 TraceCheckUtils]: 144: Hoare triple {109293#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,353 INFO L290 TraceCheckUtils]: 145: Hoare triple {109293#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,353 INFO L290 TraceCheckUtils]: 146: Hoare triple {109293#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,353 INFO L290 TraceCheckUtils]: 147: Hoare triple {109293#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,354 INFO L290 TraceCheckUtils]: 148: Hoare triple {109293#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,354 INFO L290 TraceCheckUtils]: 149: Hoare triple {109293#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,354 INFO L290 TraceCheckUtils]: 150: Hoare triple {109293#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,354 INFO L290 TraceCheckUtils]: 151: Hoare triple {109293#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {109293#false} is VALID [2022-04-27 15:44:41,354 INFO L290 TraceCheckUtils]: 152: Hoare triple {109293#false} assume 8640 == #t~mem75;havoc #t~mem75; {109293#false} is VALID [2022-04-27 15:44:41,354 INFO L290 TraceCheckUtils]: 153: Hoare triple {109293#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {109293#false} is VALID [2022-04-27 15:44:41,354 INFO L290 TraceCheckUtils]: 154: Hoare triple {109293#false} assume !(9 == ~blastFlag~0); {109293#false} is VALID [2022-04-27 15:44:41,354 INFO L290 TraceCheckUtils]: 155: Hoare triple {109293#false} assume !(12 == ~blastFlag~0); {109293#false} is VALID [2022-04-27 15:44:41,354 INFO L290 TraceCheckUtils]: 156: Hoare triple {109293#false} assume !false; {109293#false} is VALID [2022-04-27 15:44:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-27 15:44:41,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:44:41,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298854521] [2022-04-27 15:44:41,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298854521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:44:41,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:44:41,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:44:41,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990054030] [2022-04-27 15:44:41,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:44:41,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-27 15:44:41,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:44:41,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:41,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:41,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:44:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:44:41,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:44:41,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:44:41,433 INFO L87 Difference]: Start difference. First operand 1177 states and 1668 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:42,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:44:44,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:44:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:47,704 INFO L93 Difference]: Finished difference Result 2353 states and 3338 transitions. [2022-04-27 15:44:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:44:47,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-27 15:44:47,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:44:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:47,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2022-04-27 15:44:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2022-04-27 15:44:47,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 504 transitions. [2022-04-27 15:44:48,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 504 edges. 504 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:48,072 INFO L225 Difference]: With dead ends: 2353 [2022-04-27 15:44:48,072 INFO L226 Difference]: Without dead ends: 1202 [2022-04-27 15:44:48,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:44:48,074 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 33 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:44:48,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 575 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-27 15:44:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2022-04-27 15:44:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1177. [2022-04-27 15:44:48,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:44:48,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1202 states. Second operand has 1177 states, 1172 states have (on average 1.418088737201365) internal successors, (1662), 1172 states have internal predecessors, (1662), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:48,091 INFO L74 IsIncluded]: Start isIncluded. First operand 1202 states. Second operand has 1177 states, 1172 states have (on average 1.418088737201365) internal successors, (1662), 1172 states have internal predecessors, (1662), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:48,092 INFO L87 Difference]: Start difference. First operand 1202 states. Second operand has 1177 states, 1172 states have (on average 1.418088737201365) internal successors, (1662), 1172 states have internal predecessors, (1662), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:48,128 INFO L93 Difference]: Finished difference Result 1202 states and 1698 transitions. [2022-04-27 15:44:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1698 transitions. [2022-04-27 15:44:48,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:48,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:48,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 1172 states have (on average 1.418088737201365) internal successors, (1662), 1172 states have internal predecessors, (1662), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1202 states. [2022-04-27 15:44:48,130 INFO L87 Difference]: Start difference. First operand has 1177 states, 1172 states have (on average 1.418088737201365) internal successors, (1662), 1172 states have internal predecessors, (1662), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1202 states. [2022-04-27 15:44:48,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:48,164 INFO L93 Difference]: Finished difference Result 1202 states and 1698 transitions. [2022-04-27 15:44:48,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1698 transitions. [2022-04-27 15:44:48,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:48,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:48,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:44:48,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:44:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1172 states have (on average 1.418088737201365) internal successors, (1662), 1172 states have internal predecessors, (1662), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1666 transitions. [2022-04-27 15:44:48,214 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1666 transitions. Word has length 157 [2022-04-27 15:44:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:44:48,214 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1666 transitions. [2022-04-27 15:44:48,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1666 transitions. [2022-04-27 15:44:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-04-27 15:44:48,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:44:48,215 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-27 15:44:48,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-27 15:44:48,216 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:44:48,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:44:48,216 INFO L85 PathProgramCache]: Analyzing trace with hash -56561933, now seen corresponding path program 1 times [2022-04-27 15:44:48,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:44:48,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549508056] [2022-04-27 15:44:48,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:44:48,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:44:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:48,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:44:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:48,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {115575#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {115569#true} is VALID [2022-04-27 15:44:48,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {115569#true} assume true; {115569#true} is VALID [2022-04-27 15:44:48,320 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115569#true} {115569#true} #720#return; {115569#true} is VALID [2022-04-27 15:44:48,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {115569#true} call ULTIMATE.init(); {115575#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:44:48,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {115575#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {115569#true} is VALID [2022-04-27 15:44:48,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {115569#true} assume true; {115569#true} is VALID [2022-04-27 15:44:48,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115569#true} {115569#true} #720#return; {115569#true} is VALID [2022-04-27 15:44:48,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {115569#true} call #t~ret161 := main(); {115569#true} is VALID [2022-04-27 15:44:48,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {115569#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {115569#true} is VALID [2022-04-27 15:44:48,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {115569#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {115569#true} is VALID [2022-04-27 15:44:48,321 INFO L272 TraceCheckUtils]: 7: Hoare triple {115569#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {115569#true} is VALID [2022-04-27 15:44:48,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {115569#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {115569#true} is VALID [2022-04-27 15:44:48,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {115569#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {115569#true} is VALID [2022-04-27 15:44:48,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {115569#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {115569#true} is VALID [2022-04-27 15:44:48,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {115569#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {115569#true} is VALID [2022-04-27 15:44:48,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {115569#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {115569#true} is VALID [2022-04-27 15:44:48,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {115569#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {115569#true} is VALID [2022-04-27 15:44:48,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {115569#true} assume !false; {115569#true} is VALID [2022-04-27 15:44:48,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {115569#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {115569#true} is VALID [2022-04-27 15:44:48,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {115569#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {115569#true} is VALID [2022-04-27 15:44:48,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {115569#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {115569#true} is VALID [2022-04-27 15:44:48,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {115569#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {115569#true} is VALID [2022-04-27 15:44:48,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {115569#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {115569#true} is VALID [2022-04-27 15:44:48,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {115569#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {115569#true} is VALID [2022-04-27 15:44:48,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {115569#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {115569#true} is VALID [2022-04-27 15:44:48,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {115569#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {115569#true} is VALID [2022-04-27 15:44:48,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {115569#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {115569#true} is VALID [2022-04-27 15:44:48,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {115569#true} assume 8464 == #t~mem55;havoc #t~mem55; {115569#true} is VALID [2022-04-27 15:44:48,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {115569#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {115569#true} is VALID [2022-04-27 15:44:48,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {115569#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !false; {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,327 INFO L290 TraceCheckUtils]: 42: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,328 INFO L290 TraceCheckUtils]: 43: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {115574#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {115574#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {115570#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 48: Hoare triple {115570#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 49: Hoare triple {115570#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 50: Hoare triple {115570#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {115570#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 52: Hoare triple {115570#false} ~skip~0 := 0; {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 53: Hoare triple {115570#false} assume !false; {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 54: Hoare triple {115570#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 55: Hoare triple {115570#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {115570#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {115570#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 58: Hoare triple {115570#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 59: Hoare triple {115570#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 60: Hoare triple {115570#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 61: Hoare triple {115570#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,329 INFO L290 TraceCheckUtils]: 62: Hoare triple {115570#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 63: Hoare triple {115570#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 64: Hoare triple {115570#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 65: Hoare triple {115570#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 66: Hoare triple {115570#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 67: Hoare triple {115570#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 68: Hoare triple {115570#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {115570#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {115570#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 71: Hoare triple {115570#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {115570#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {115570#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 74: Hoare triple {115570#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 75: Hoare triple {115570#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 76: Hoare triple {115570#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 77: Hoare triple {115570#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 78: Hoare triple {115570#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 79: Hoare triple {115570#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,330 INFO L290 TraceCheckUtils]: 80: Hoare triple {115570#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 81: Hoare triple {115570#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 82: Hoare triple {115570#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 83: Hoare triple {115570#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 84: Hoare triple {115570#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 85: Hoare triple {115570#false} assume 8656 == #t~mem77;havoc #t~mem77; {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 86: Hoare triple {115570#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 87: Hoare triple {115570#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 88: Hoare triple {115570#false} assume 10 == ~blastFlag~0;~blastFlag~0 := 11; {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 89: Hoare triple {115570#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 90: Hoare triple {115570#false} assume !(0 == ~tmp___10~0); {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 91: Hoare triple {115570#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 92: Hoare triple {115570#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 93: Hoare triple {115570#false} ~skip~0 := 0; {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 94: Hoare triple {115570#false} assume !false; {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 95: Hoare triple {115570#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,331 INFO L290 TraceCheckUtils]: 96: Hoare triple {115570#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 97: Hoare triple {115570#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 98: Hoare triple {115570#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 99: Hoare triple {115570#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 100: Hoare triple {115570#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 101: Hoare triple {115570#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 102: Hoare triple {115570#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 103: Hoare triple {115570#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 104: Hoare triple {115570#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 105: Hoare triple {115570#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 106: Hoare triple {115570#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 107: Hoare triple {115570#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 108: Hoare triple {115570#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 109: Hoare triple {115570#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 110: Hoare triple {115570#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 111: Hoare triple {115570#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 112: Hoare triple {115570#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,332 INFO L290 TraceCheckUtils]: 113: Hoare triple {115570#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 114: Hoare triple {115570#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 115: Hoare triple {115570#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 116: Hoare triple {115570#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 117: Hoare triple {115570#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 118: Hoare triple {115570#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 119: Hoare triple {115570#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 120: Hoare triple {115570#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 121: Hoare triple {115570#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 122: Hoare triple {115570#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 123: Hoare triple {115570#false} assume 8609 == #t~mem74;havoc #t~mem74; {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 124: Hoare triple {115570#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 125: Hoare triple {115570#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 126: Hoare triple {115570#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 127: Hoare triple {115570#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 128: Hoare triple {115570#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 129: Hoare triple {115570#false} ~skip~0 := 0; {115570#false} is VALID [2022-04-27 15:44:48,333 INFO L290 TraceCheckUtils]: 130: Hoare triple {115570#false} assume !false; {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 131: Hoare triple {115570#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 132: Hoare triple {115570#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 133: Hoare triple {115570#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 134: Hoare triple {115570#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 135: Hoare triple {115570#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 136: Hoare triple {115570#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 137: Hoare triple {115570#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 138: Hoare triple {115570#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 139: Hoare triple {115570#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 140: Hoare triple {115570#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 141: Hoare triple {115570#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 142: Hoare triple {115570#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 143: Hoare triple {115570#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 144: Hoare triple {115570#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 145: Hoare triple {115570#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 146: Hoare triple {115570#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 147: Hoare triple {115570#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,334 INFO L290 TraceCheckUtils]: 148: Hoare triple {115570#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 149: Hoare triple {115570#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 150: Hoare triple {115570#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 151: Hoare triple {115570#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 152: Hoare triple {115570#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 153: Hoare triple {115570#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 154: Hoare triple {115570#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 155: Hoare triple {115570#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 156: Hoare triple {115570#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 157: Hoare triple {115570#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 158: Hoare triple {115570#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 159: Hoare triple {115570#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 160: Hoare triple {115570#false} assume 8640 == #t~mem75;havoc #t~mem75; {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 161: Hoare triple {115570#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 162: Hoare triple {115570#false} assume !(9 == ~blastFlag~0); {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 163: Hoare triple {115570#false} assume !(12 == ~blastFlag~0); {115570#false} is VALID [2022-04-27 15:44:48,335 INFO L290 TraceCheckUtils]: 164: Hoare triple {115570#false} assume !false; {115570#false} is VALID [2022-04-27 15:44:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-27 15:44:48,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:44:48,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549508056] [2022-04-27 15:44:48,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549508056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:44:48,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:44:48,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:44:48,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215095835] [2022-04-27 15:44:48,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:44:48,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2022-04-27 15:44:48,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:44:48,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:48,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:48,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:44:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:44:48,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:44:48,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:44:48,400 INFO L87 Difference]: Start difference. First operand 1177 states and 1666 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:51,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:51,700 INFO L93 Difference]: Finished difference Result 2355 states and 3339 transitions. [2022-04-27 15:44:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:44:51,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2022-04-27 15:44:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:44:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2022-04-27 15:44:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2022-04-27 15:44:51,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 468 transitions. [2022-04-27 15:44:51,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:52,031 INFO L225 Difference]: With dead ends: 2355 [2022-04-27 15:44:52,031 INFO L226 Difference]: Without dead ends: 1204 [2022-04-27 15:44:52,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:44:52,032 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:44:52,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 427 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 15:44:52,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2022-04-27 15:44:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1204. [2022-04-27 15:44:52,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:44:52,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1204 states. Second operand has 1204 states, 1199 states have (on average 1.41534612176814) internal successors, (1697), 1199 states have internal predecessors, (1697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:52,054 INFO L74 IsIncluded]: Start isIncluded. First operand 1204 states. Second operand has 1204 states, 1199 states have (on average 1.41534612176814) internal successors, (1697), 1199 states have internal predecessors, (1697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:52,055 INFO L87 Difference]: Start difference. First operand 1204 states. Second operand has 1204 states, 1199 states have (on average 1.41534612176814) internal successors, (1697), 1199 states have internal predecessors, (1697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:52,093 INFO L93 Difference]: Finished difference Result 1204 states and 1701 transitions. [2022-04-27 15:44:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1701 transitions. [2022-04-27 15:44:52,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:52,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:52,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 1204 states, 1199 states have (on average 1.41534612176814) internal successors, (1697), 1199 states have internal predecessors, (1697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1204 states. [2022-04-27 15:44:52,096 INFO L87 Difference]: Start difference. First operand has 1204 states, 1199 states have (on average 1.41534612176814) internal successors, (1697), 1199 states have internal predecessors, (1697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1204 states. [2022-04-27 15:44:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:52,133 INFO L93 Difference]: Finished difference Result 1204 states and 1701 transitions. [2022-04-27 15:44:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1701 transitions. [2022-04-27 15:44:52,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:52,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:52,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:44:52,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:44:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1199 states have (on average 1.41534612176814) internal successors, (1697), 1199 states have internal predecessors, (1697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1701 transitions. [2022-04-27 15:44:52,173 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1701 transitions. Word has length 165 [2022-04-27 15:44:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:44:52,173 INFO L495 AbstractCegarLoop]: Abstraction has 1204 states and 1701 transitions. [2022-04-27 15:44:52,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1701 transitions. [2022-04-27 15:44:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-04-27 15:44:52,174 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:44:52,174 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-27 15:44:52,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-27 15:44:52,174 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:44:52,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:44:52,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1844431755, now seen corresponding path program 1 times [2022-04-27 15:44:52,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:44:52,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012706610] [2022-04-27 15:44:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:44:52,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:44:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:52,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:44:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:52,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {121882#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {121876#true} is VALID [2022-04-27 15:44:52,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {121876#true} assume true; {121876#true} is VALID [2022-04-27 15:44:52,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121876#true} {121876#true} #720#return; {121876#true} is VALID [2022-04-27 15:44:52,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {121876#true} call ULTIMATE.init(); {121882#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:44:52,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {121882#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {121876#true} is VALID [2022-04-27 15:44:52,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {121876#true} assume true; {121876#true} is VALID [2022-04-27 15:44:52,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121876#true} {121876#true} #720#return; {121876#true} is VALID [2022-04-27 15:44:52,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {121876#true} call #t~ret161 := main(); {121876#true} is VALID [2022-04-27 15:44:52,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {121876#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {121876#true} is VALID [2022-04-27 15:44:52,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {121876#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {121876#true} is VALID [2022-04-27 15:44:52,288 INFO L272 TraceCheckUtils]: 7: Hoare triple {121876#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {121876#true} is VALID [2022-04-27 15:44:52,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {121876#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} assume !false; {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {121881#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:44:52,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {121881#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {121877#false} is VALID [2022-04-27 15:44:52,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {121877#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {121877#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {121877#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {121877#false} is VALID [2022-04-27 15:44:52,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {121877#false} ~skip~0 := 0; {121877#false} is VALID [2022-04-27 15:44:52,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {121877#false} assume !false; {121877#false} is VALID [2022-04-27 15:44:52,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {121877#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {121877#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {121877#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {121877#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {121877#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {121877#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {121877#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {121877#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 40: Hoare triple {121877#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {121877#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {121877#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {121877#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 44: Hoare triple {121877#false} assume 8496 == #t~mem58;havoc #t~mem58; {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 45: Hoare triple {121877#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 46: Hoare triple {121877#false} assume !(1 == ~blastFlag~0); {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 47: Hoare triple {121877#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 48: Hoare triple {121877#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 49: Hoare triple {121877#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 50: Hoare triple {121877#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {121877#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {121877#false} ~skip~0 := 0; {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {121877#false} assume !false; {121877#false} is VALID [2022-04-27 15:44:52,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {121877#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 55: Hoare triple {121877#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 56: Hoare triple {121877#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 57: Hoare triple {121877#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 58: Hoare triple {121877#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 59: Hoare triple {121877#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 60: Hoare triple {121877#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 61: Hoare triple {121877#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 62: Hoare triple {121877#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 63: Hoare triple {121877#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 64: Hoare triple {121877#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 65: Hoare triple {121877#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 66: Hoare triple {121877#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {121877#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {121877#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 69: Hoare triple {121877#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,296 INFO L290 TraceCheckUtils]: 70: Hoare triple {121877#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 71: Hoare triple {121877#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 72: Hoare triple {121877#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 73: Hoare triple {121877#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 74: Hoare triple {121877#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 75: Hoare triple {121877#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 76: Hoare triple {121877#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 77: Hoare triple {121877#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 78: Hoare triple {121877#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 79: Hoare triple {121877#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 80: Hoare triple {121877#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 81: Hoare triple {121877#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 82: Hoare triple {121877#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 83: Hoare triple {121877#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 84: Hoare triple {121877#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 85: Hoare triple {121877#false} assume 8656 == #t~mem77;havoc #t~mem77; {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 86: Hoare triple {121877#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 87: Hoare triple {121877#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {121877#false} is VALID [2022-04-27 15:44:52,297 INFO L290 TraceCheckUtils]: 88: Hoare triple {121877#false} assume 10 == ~blastFlag~0;~blastFlag~0 := 11; {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 89: Hoare triple {121877#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 90: Hoare triple {121877#false} assume !(0 == ~tmp___10~0); {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 91: Hoare triple {121877#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 92: Hoare triple {121877#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 93: Hoare triple {121877#false} ~skip~0 := 0; {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 94: Hoare triple {121877#false} assume !false; {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 95: Hoare triple {121877#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 96: Hoare triple {121877#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 97: Hoare triple {121877#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 98: Hoare triple {121877#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 99: Hoare triple {121877#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 100: Hoare triple {121877#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 101: Hoare triple {121877#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 102: Hoare triple {121877#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 103: Hoare triple {121877#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 104: Hoare triple {121877#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,298 INFO L290 TraceCheckUtils]: 105: Hoare triple {121877#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 106: Hoare triple {121877#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 107: Hoare triple {121877#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 108: Hoare triple {121877#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 109: Hoare triple {121877#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 110: Hoare triple {121877#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 111: Hoare triple {121877#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 112: Hoare triple {121877#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 113: Hoare triple {121877#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 114: Hoare triple {121877#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 115: Hoare triple {121877#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 116: Hoare triple {121877#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 117: Hoare triple {121877#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 118: Hoare triple {121877#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 119: Hoare triple {121877#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 120: Hoare triple {121877#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 121: Hoare triple {121877#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 122: Hoare triple {121877#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,299 INFO L290 TraceCheckUtils]: 123: Hoare triple {121877#false} assume 8609 == #t~mem74;havoc #t~mem74; {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 124: Hoare triple {121877#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 125: Hoare triple {121877#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 126: Hoare triple {121877#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 127: Hoare triple {121877#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 128: Hoare triple {121877#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 129: Hoare triple {121877#false} ~skip~0 := 0; {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 130: Hoare triple {121877#false} assume !false; {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 131: Hoare triple {121877#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 132: Hoare triple {121877#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 133: Hoare triple {121877#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 134: Hoare triple {121877#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 135: Hoare triple {121877#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 136: Hoare triple {121877#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 137: Hoare triple {121877#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 138: Hoare triple {121877#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 139: Hoare triple {121877#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,300 INFO L290 TraceCheckUtils]: 140: Hoare triple {121877#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 141: Hoare triple {121877#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 142: Hoare triple {121877#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 143: Hoare triple {121877#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 144: Hoare triple {121877#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 145: Hoare triple {121877#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 146: Hoare triple {121877#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 147: Hoare triple {121877#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 148: Hoare triple {121877#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 149: Hoare triple {121877#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 150: Hoare triple {121877#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 151: Hoare triple {121877#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 152: Hoare triple {121877#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 153: Hoare triple {121877#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 154: Hoare triple {121877#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 155: Hoare triple {121877#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 156: Hoare triple {121877#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 157: Hoare triple {121877#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,301 INFO L290 TraceCheckUtils]: 158: Hoare triple {121877#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,302 INFO L290 TraceCheckUtils]: 159: Hoare triple {121877#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {121877#false} is VALID [2022-04-27 15:44:52,302 INFO L290 TraceCheckUtils]: 160: Hoare triple {121877#false} assume 8640 == #t~mem75;havoc #t~mem75; {121877#false} is VALID [2022-04-27 15:44:52,302 INFO L290 TraceCheckUtils]: 161: Hoare triple {121877#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {121877#false} is VALID [2022-04-27 15:44:52,302 INFO L290 TraceCheckUtils]: 162: Hoare triple {121877#false} assume !(9 == ~blastFlag~0); {121877#false} is VALID [2022-04-27 15:44:52,302 INFO L290 TraceCheckUtils]: 163: Hoare triple {121877#false} assume !(12 == ~blastFlag~0); {121877#false} is VALID [2022-04-27 15:44:52,302 INFO L290 TraceCheckUtils]: 164: Hoare triple {121877#false} assume !false; {121877#false} is VALID [2022-04-27 15:44:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-04-27 15:44:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:44:52,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012706610] [2022-04-27 15:44:52,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012706610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:44:52,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:44:52,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:44:52,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114555684] [2022-04-27 15:44:52,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:44:52,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2022-04-27 15:44:52,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:44:52,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:52,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:52,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:44:52,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:44:52,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:44:52,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:44:52,357 INFO L87 Difference]: Start difference. First operand 1204 states and 1701 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:56,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:44:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:57,022 INFO L93 Difference]: Finished difference Result 2384 states and 3375 transitions. [2022-04-27 15:44:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:44:57,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2022-04-27 15:44:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:44:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions. [2022-04-27 15:44:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions. [2022-04-27 15:44:57,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 445 transitions. [2022-04-27 15:44:57,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:57,354 INFO L225 Difference]: With dead ends: 2384 [2022-04-27 15:44:57,354 INFO L226 Difference]: Without dead ends: 1206 [2022-04-27 15:44:57,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:44:57,359 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:44:57,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 406 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-04-27 15:44:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2022-04-27 15:44:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1206. [2022-04-27 15:44:57,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:44:57,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1206 states. Second operand has 1206 states, 1201 states have (on average 1.414654454621149) internal successors, (1699), 1201 states have internal predecessors, (1699), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:57,379 INFO L74 IsIncluded]: Start isIncluded. First operand 1206 states. Second operand has 1206 states, 1201 states have (on average 1.414654454621149) internal successors, (1699), 1201 states have internal predecessors, (1699), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:57,380 INFO L87 Difference]: Start difference. First operand 1206 states. Second operand has 1206 states, 1201 states have (on average 1.414654454621149) internal successors, (1699), 1201 states have internal predecessors, (1699), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:57,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:57,415 INFO L93 Difference]: Finished difference Result 1206 states and 1703 transitions. [2022-04-27 15:44:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1703 transitions. [2022-04-27 15:44:57,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:57,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:57,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 1206 states, 1201 states have (on average 1.414654454621149) internal successors, (1699), 1201 states have internal predecessors, (1699), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1206 states. [2022-04-27 15:44:57,418 INFO L87 Difference]: Start difference. First operand has 1206 states, 1201 states have (on average 1.414654454621149) internal successors, (1699), 1201 states have internal predecessors, (1699), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1206 states. [2022-04-27 15:44:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:44:57,464 INFO L93 Difference]: Finished difference Result 1206 states and 1703 transitions. [2022-04-27 15:44:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1703 transitions. [2022-04-27 15:44:57,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:44:57,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:44:57,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:44:57,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:44:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1201 states have (on average 1.414654454621149) internal successors, (1699), 1201 states have internal predecessors, (1699), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1703 transitions. [2022-04-27 15:44:57,516 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1703 transitions. Word has length 165 [2022-04-27 15:44:57,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:44:57,516 INFO L495 AbstractCegarLoop]: Abstraction has 1206 states and 1703 transitions. [2022-04-27 15:44:57,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:57,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1703 transitions. [2022-04-27 15:44:57,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-04-27 15:44:57,517 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:44:57,518 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-27 15:44:57,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-27 15:44:57,518 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:44:57,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:44:57,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1693159867, now seen corresponding path program 1 times [2022-04-27 15:44:57,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:44:57,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165779364] [2022-04-27 15:44:57,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:44:57,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:44:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:57,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:44:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:44:57,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {128231#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {128224#true} is VALID [2022-04-27 15:44:57,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {128224#true} assume true; {128224#true} is VALID [2022-04-27 15:44:57,649 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128224#true} {128224#true} #720#return; {128224#true} is VALID [2022-04-27 15:44:57,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {128224#true} call ULTIMATE.init(); {128231#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:44:57,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {128231#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {128224#true} is VALID [2022-04-27 15:44:57,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {128224#true} assume true; {128224#true} is VALID [2022-04-27 15:44:57,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128224#true} {128224#true} #720#return; {128224#true} is VALID [2022-04-27 15:44:57,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {128224#true} call #t~ret161 := main(); {128224#true} is VALID [2022-04-27 15:44:57,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {128224#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {128224#true} is VALID [2022-04-27 15:44:57,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {128224#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,651 INFO L272 TraceCheckUtils]: 7: Hoare triple {128224#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {128224#true} is VALID [2022-04-27 15:44:57,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {128224#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {128224#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {128224#true} is VALID [2022-04-27 15:44:57,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {128224#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {128224#true} is VALID [2022-04-27 15:44:57,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {128224#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {128224#true} is VALID [2022-04-27 15:44:57,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {128224#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {128224#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {128224#true} is VALID [2022-04-27 15:44:57,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {128224#true} assume !false; {128224#true} is VALID [2022-04-27 15:44:57,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {128224#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {128224#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {128224#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {128224#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {128224#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {128224#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {128224#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {128224#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {128224#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {128224#true} assume 8464 == #t~mem55;havoc #t~mem55; {128224#true} is VALID [2022-04-27 15:44:57,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {128224#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {128224#true} is VALID [2022-04-27 15:44:57,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {128224#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {128224#true} is VALID [2022-04-27 15:44:57,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {128224#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {128224#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {128224#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {128224#true} is VALID [2022-04-27 15:44:57,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {128224#true} ~skip~0 := 0; {128224#true} is VALID [2022-04-27 15:44:57,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {128224#true} assume !false; {128224#true} is VALID [2022-04-27 15:44:57,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {128224#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {128224#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {128224#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {128224#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {128224#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {128224#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {128224#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {128224#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {128224#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {128224#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {128224#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,654 INFO L290 TraceCheckUtils]: 43: Hoare triple {128224#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {128224#true} assume 8496 == #t~mem58;havoc #t~mem58; {128224#true} is VALID [2022-04-27 15:44:57,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {128224#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {128224#true} is VALID [2022-04-27 15:44:57,654 INFO L290 TraceCheckUtils]: 46: Hoare triple {128224#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {128224#true} is VALID [2022-04-27 15:44:57,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {128224#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,654 INFO L290 TraceCheckUtils]: 48: Hoare triple {128224#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,654 INFO L290 TraceCheckUtils]: 49: Hoare triple {128224#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,655 INFO L290 TraceCheckUtils]: 50: Hoare triple {128224#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,655 INFO L290 TraceCheckUtils]: 51: Hoare triple {128224#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {128224#true} is VALID [2022-04-27 15:44:57,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {128224#true} ~skip~0 := 0; {128224#true} is VALID [2022-04-27 15:44:57,655 INFO L290 TraceCheckUtils]: 53: Hoare triple {128224#true} assume !false; {128224#true} is VALID [2022-04-27 15:44:57,655 INFO L290 TraceCheckUtils]: 54: Hoare triple {128224#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,655 INFO L290 TraceCheckUtils]: 55: Hoare triple {128224#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,655 INFO L290 TraceCheckUtils]: 56: Hoare triple {128224#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,655 INFO L290 TraceCheckUtils]: 57: Hoare triple {128224#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,655 INFO L290 TraceCheckUtils]: 58: Hoare triple {128224#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,655 INFO L290 TraceCheckUtils]: 59: Hoare triple {128224#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,655 INFO L290 TraceCheckUtils]: 60: Hoare triple {128224#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {128224#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,655 INFO L290 TraceCheckUtils]: 62: Hoare triple {128224#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,656 INFO L290 TraceCheckUtils]: 63: Hoare triple {128224#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,656 INFO L290 TraceCheckUtils]: 64: Hoare triple {128224#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,656 INFO L290 TraceCheckUtils]: 65: Hoare triple {128224#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,656 INFO L290 TraceCheckUtils]: 66: Hoare triple {128224#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,656 INFO L290 TraceCheckUtils]: 67: Hoare triple {128224#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,656 INFO L290 TraceCheckUtils]: 68: Hoare triple {128224#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,656 INFO L290 TraceCheckUtils]: 69: Hoare triple {128224#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,656 INFO L290 TraceCheckUtils]: 70: Hoare triple {128224#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,656 INFO L290 TraceCheckUtils]: 71: Hoare triple {128224#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,656 INFO L290 TraceCheckUtils]: 72: Hoare triple {128224#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,656 INFO L290 TraceCheckUtils]: 73: Hoare triple {128224#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,656 INFO L290 TraceCheckUtils]: 74: Hoare triple {128224#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,657 INFO L290 TraceCheckUtils]: 75: Hoare triple {128224#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,657 INFO L290 TraceCheckUtils]: 76: Hoare triple {128224#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,657 INFO L290 TraceCheckUtils]: 77: Hoare triple {128224#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,657 INFO L290 TraceCheckUtils]: 78: Hoare triple {128224#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,657 INFO L290 TraceCheckUtils]: 79: Hoare triple {128224#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,657 INFO L290 TraceCheckUtils]: 80: Hoare triple {128224#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,657 INFO L290 TraceCheckUtils]: 81: Hoare triple {128224#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,657 INFO L290 TraceCheckUtils]: 82: Hoare triple {128224#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,657 INFO L290 TraceCheckUtils]: 83: Hoare triple {128224#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,657 INFO L290 TraceCheckUtils]: 84: Hoare triple {128224#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {128224#true} is VALID [2022-04-27 15:44:57,657 INFO L290 TraceCheckUtils]: 85: Hoare triple {128224#true} assume 8656 == #t~mem77;havoc #t~mem77; {128224#true} is VALID [2022-04-27 15:44:57,657 INFO L290 TraceCheckUtils]: 86: Hoare triple {128224#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {128224#true} is VALID [2022-04-27 15:44:57,657 INFO L290 TraceCheckUtils]: 87: Hoare triple {128224#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {128224#true} is VALID [2022-04-27 15:44:57,658 INFO L290 TraceCheckUtils]: 88: Hoare triple {128224#true} assume !(10 == ~blastFlag~0); {128224#true} is VALID [2022-04-27 15:44:57,658 INFO L290 TraceCheckUtils]: 89: Hoare triple {128224#true} assume !(13 == ~blastFlag~0); {128224#true} is VALID [2022-04-27 15:44:57,659 INFO L290 TraceCheckUtils]: 90: Hoare triple {128224#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,659 INFO L290 TraceCheckUtils]: 91: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == ~tmp___10~0); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,659 INFO L290 TraceCheckUtils]: 92: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,660 INFO L290 TraceCheckUtils]: 93: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,660 INFO L290 TraceCheckUtils]: 94: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,661 INFO L290 TraceCheckUtils]: 95: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,661 INFO L290 TraceCheckUtils]: 96: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,661 INFO L290 TraceCheckUtils]: 97: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,662 INFO L290 TraceCheckUtils]: 98: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,662 INFO L290 TraceCheckUtils]: 99: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,663 INFO L290 TraceCheckUtils]: 100: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,663 INFO L290 TraceCheckUtils]: 101: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,663 INFO L290 TraceCheckUtils]: 102: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,664 INFO L290 TraceCheckUtils]: 103: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,664 INFO L290 TraceCheckUtils]: 104: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,664 INFO L290 TraceCheckUtils]: 105: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,665 INFO L290 TraceCheckUtils]: 106: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,665 INFO L290 TraceCheckUtils]: 107: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,666 INFO L290 TraceCheckUtils]: 108: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,666 INFO L290 TraceCheckUtils]: 109: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,666 INFO L290 TraceCheckUtils]: 110: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,667 INFO L290 TraceCheckUtils]: 111: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,667 INFO L290 TraceCheckUtils]: 112: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,668 INFO L290 TraceCheckUtils]: 113: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,668 INFO L290 TraceCheckUtils]: 114: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,668 INFO L290 TraceCheckUtils]: 115: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,669 INFO L290 TraceCheckUtils]: 116: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,669 INFO L290 TraceCheckUtils]: 117: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,669 INFO L290 TraceCheckUtils]: 118: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,670 INFO L290 TraceCheckUtils]: 119: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,670 INFO L290 TraceCheckUtils]: 120: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,671 INFO L290 TraceCheckUtils]: 121: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,671 INFO L290 TraceCheckUtils]: 122: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:44:57,671 INFO L290 TraceCheckUtils]: 123: Hoare triple {128229#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {128230#(= |ssl3_accept_#t~mem74| 8672)} is VALID [2022-04-27 15:44:57,672 INFO L290 TraceCheckUtils]: 124: Hoare triple {128230#(= |ssl3_accept_#t~mem74| 8672)} assume 8609 == #t~mem74;havoc #t~mem74; {128225#false} is VALID [2022-04-27 15:44:57,672 INFO L290 TraceCheckUtils]: 125: Hoare triple {128225#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {128225#false} is VALID [2022-04-27 15:44:57,672 INFO L290 TraceCheckUtils]: 126: Hoare triple {128225#false} assume !(8 == ~blastFlag~0); {128225#false} is VALID [2022-04-27 15:44:57,672 INFO L290 TraceCheckUtils]: 127: Hoare triple {128225#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,672 INFO L290 TraceCheckUtils]: 128: Hoare triple {128225#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,672 INFO L290 TraceCheckUtils]: 129: Hoare triple {128225#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {128225#false} is VALID [2022-04-27 15:44:57,672 INFO L290 TraceCheckUtils]: 130: Hoare triple {128225#false} ~skip~0 := 0; {128225#false} is VALID [2022-04-27 15:44:57,672 INFO L290 TraceCheckUtils]: 131: Hoare triple {128225#false} assume !false; {128225#false} is VALID [2022-04-27 15:44:57,673 INFO L290 TraceCheckUtils]: 132: Hoare triple {128225#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,673 INFO L290 TraceCheckUtils]: 133: Hoare triple {128225#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,673 INFO L290 TraceCheckUtils]: 134: Hoare triple {128225#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,673 INFO L290 TraceCheckUtils]: 135: Hoare triple {128225#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,673 INFO L290 TraceCheckUtils]: 136: Hoare triple {128225#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,673 INFO L290 TraceCheckUtils]: 137: Hoare triple {128225#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,673 INFO L290 TraceCheckUtils]: 138: Hoare triple {128225#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,673 INFO L290 TraceCheckUtils]: 139: Hoare triple {128225#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,673 INFO L290 TraceCheckUtils]: 140: Hoare triple {128225#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,673 INFO L290 TraceCheckUtils]: 141: Hoare triple {128225#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,673 INFO L290 TraceCheckUtils]: 142: Hoare triple {128225#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,673 INFO L290 TraceCheckUtils]: 143: Hoare triple {128225#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,674 INFO L290 TraceCheckUtils]: 144: Hoare triple {128225#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,674 INFO L290 TraceCheckUtils]: 145: Hoare triple {128225#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,674 INFO L290 TraceCheckUtils]: 146: Hoare triple {128225#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,674 INFO L290 TraceCheckUtils]: 147: Hoare triple {128225#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,674 INFO L290 TraceCheckUtils]: 148: Hoare triple {128225#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,674 INFO L290 TraceCheckUtils]: 149: Hoare triple {128225#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,674 INFO L290 TraceCheckUtils]: 150: Hoare triple {128225#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,674 INFO L290 TraceCheckUtils]: 151: Hoare triple {128225#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,674 INFO L290 TraceCheckUtils]: 152: Hoare triple {128225#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,674 INFO L290 TraceCheckUtils]: 153: Hoare triple {128225#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,674 INFO L290 TraceCheckUtils]: 154: Hoare triple {128225#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,674 INFO L290 TraceCheckUtils]: 155: Hoare triple {128225#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,675 INFO L290 TraceCheckUtils]: 156: Hoare triple {128225#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,675 INFO L290 TraceCheckUtils]: 157: Hoare triple {128225#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,675 INFO L290 TraceCheckUtils]: 158: Hoare triple {128225#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,675 INFO L290 TraceCheckUtils]: 159: Hoare triple {128225#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,675 INFO L290 TraceCheckUtils]: 160: Hoare triple {128225#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {128225#false} is VALID [2022-04-27 15:44:57,675 INFO L290 TraceCheckUtils]: 161: Hoare triple {128225#false} assume 8640 == #t~mem75;havoc #t~mem75; {128225#false} is VALID [2022-04-27 15:44:57,675 INFO L290 TraceCheckUtils]: 162: Hoare triple {128225#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {128225#false} is VALID [2022-04-27 15:44:57,675 INFO L290 TraceCheckUtils]: 163: Hoare triple {128225#false} assume !(9 == ~blastFlag~0); {128225#false} is VALID [2022-04-27 15:44:57,675 INFO L290 TraceCheckUtils]: 164: Hoare triple {128225#false} assume !(12 == ~blastFlag~0); {128225#false} is VALID [2022-04-27 15:44:57,675 INFO L290 TraceCheckUtils]: 165: Hoare triple {128225#false} assume !false; {128225#false} is VALID [2022-04-27 15:44:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 15:44:57,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:44:57,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165779364] [2022-04-27 15:44:57,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165779364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:44:57,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:44:57,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:44:57,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683968472] [2022-04-27 15:44:57,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:44:57,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 166 [2022-04-27 15:44:57,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:44:57,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:44:57,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:44:57,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:44:57,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:44:57,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:44:57,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:44:57,765 INFO L87 Difference]: Start difference. First operand 1206 states and 1703 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:45:01,015 INFO L93 Difference]: Finished difference Result 2520 states and 3558 transitions. [2022-04-27 15:45:01,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:45:01,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 166 [2022-04-27 15:45:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:45:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 526 transitions. [2022-04-27 15:45:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 526 transitions. [2022-04-27 15:45:01,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 526 transitions. [2022-04-27 15:45:01,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 526 edges. 526 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:45:01,411 INFO L225 Difference]: With dead ends: 2520 [2022-04-27 15:45:01,411 INFO L226 Difference]: Without dead ends: 1342 [2022-04-27 15:45:01,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:45:01,413 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 50 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:45:01,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 614 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 15:45:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2022-04-27 15:45:01,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1282. [2022-04-27 15:45:01,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:45:01,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1342 states. Second operand has 1282 states, 1277 states have (on average 1.4119028974158183) internal successors, (1803), 1277 states have internal predecessors, (1803), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:01,430 INFO L74 IsIncluded]: Start isIncluded. First operand 1342 states. Second operand has 1282 states, 1277 states have (on average 1.4119028974158183) internal successors, (1803), 1277 states have internal predecessors, (1803), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:01,430 INFO L87 Difference]: Start difference. First operand 1342 states. Second operand has 1282 states, 1277 states have (on average 1.4119028974158183) internal successors, (1803), 1277 states have internal predecessors, (1803), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:01,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:45:01,472 INFO L93 Difference]: Finished difference Result 1342 states and 1885 transitions. [2022-04-27 15:45:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1885 transitions. [2022-04-27 15:45:01,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:45:01,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:45:01,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 1282 states, 1277 states have (on average 1.4119028974158183) internal successors, (1803), 1277 states have internal predecessors, (1803), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1342 states. [2022-04-27 15:45:01,487 INFO L87 Difference]: Start difference. First operand has 1282 states, 1277 states have (on average 1.4119028974158183) internal successors, (1803), 1277 states have internal predecessors, (1803), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1342 states. [2022-04-27 15:45:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:45:01,531 INFO L93 Difference]: Finished difference Result 1342 states and 1885 transitions. [2022-04-27 15:45:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1885 transitions. [2022-04-27 15:45:01,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:45:01,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:45:01,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:45:01,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:45:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1277 states have (on average 1.4119028974158183) internal successors, (1803), 1277 states have internal predecessors, (1803), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1807 transitions. [2022-04-27 15:45:01,575 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1807 transitions. Word has length 166 [2022-04-27 15:45:01,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:45:01,575 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1807 transitions. [2022-04-27 15:45:01,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1807 transitions. [2022-04-27 15:45:01,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-04-27 15:45:01,576 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:45:01,576 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:45:01,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-27 15:45:01,576 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:45:01,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:45:01,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1911069330, now seen corresponding path program 1 times [2022-04-27 15:45:01,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:45:01,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50884531] [2022-04-27 15:45:01,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:45:01,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:45:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:45:01,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:45:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:45:01,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {135092#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {135083#true} is VALID [2022-04-27 15:45:01,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {135083#true} assume true; {135083#true} is VALID [2022-04-27 15:45:01,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135083#true} {135083#true} #720#return; {135083#true} is VALID [2022-04-27 15:45:01,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {135083#true} call ULTIMATE.init(); {135092#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:45:01,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {135092#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {135083#true} is VALID [2022-04-27 15:45:01,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {135083#true} assume true; {135083#true} is VALID [2022-04-27 15:45:01,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135083#true} {135083#true} #720#return; {135083#true} is VALID [2022-04-27 15:45:01,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {135083#true} call #t~ret161 := main(); {135083#true} is VALID [2022-04-27 15:45:01,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {135083#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {135083#true} is VALID [2022-04-27 15:45:01,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {135083#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {135088#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} is VALID [2022-04-27 15:45:01,976 INFO L272 TraceCheckUtils]: 7: Hoare triple {135088#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {135089#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} is VALID [2022-04-27 15:45:01,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {135089#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {135090#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:45:01,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {135090#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {135090#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:45:01,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {135090#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {135090#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:45:01,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {135090#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {135090#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:45:01,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {135090#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {135091#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-27 15:45:01,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {135091#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {135084#false} is VALID [2022-04-27 15:45:01,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {135084#false} assume !false; {135084#false} is VALID [2022-04-27 15:45:01,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {135084#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {135084#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {135084#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {135084#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {135084#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {135084#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {135084#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {135084#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {135084#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {135084#false} assume 8464 == #t~mem55;havoc #t~mem55; {135084#false} is VALID [2022-04-27 15:45:01,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {135084#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {135084#false} is VALID [2022-04-27 15:45:01,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {135084#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {135084#false} is VALID [2022-04-27 15:45:01,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {135084#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {135084#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {135084#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {135084#false} is VALID [2022-04-27 15:45:01,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {135084#false} ~skip~0 := 0; {135084#false} is VALID [2022-04-27 15:45:01,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {135084#false} assume !false; {135084#false} is VALID [2022-04-27 15:45:01,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {135084#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {135084#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {135084#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {135084#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {135084#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {135084#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {135084#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {135084#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {135084#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {135084#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {135084#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,988 INFO L290 TraceCheckUtils]: 43: Hoare triple {135084#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,988 INFO L290 TraceCheckUtils]: 44: Hoare triple {135084#false} assume 8496 == #t~mem58;havoc #t~mem58; {135084#false} is VALID [2022-04-27 15:45:01,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {135084#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {135084#false} is VALID [2022-04-27 15:45:01,988 INFO L290 TraceCheckUtils]: 46: Hoare triple {135084#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {135084#false} is VALID [2022-04-27 15:45:01,988 INFO L290 TraceCheckUtils]: 47: Hoare triple {135084#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {135084#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {135084#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {135084#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,988 INFO L290 TraceCheckUtils]: 51: Hoare triple {135084#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {135084#false} is VALID [2022-04-27 15:45:01,988 INFO L290 TraceCheckUtils]: 52: Hoare triple {135084#false} ~skip~0 := 0; {135084#false} is VALID [2022-04-27 15:45:01,989 INFO L290 TraceCheckUtils]: 53: Hoare triple {135084#false} assume !false; {135084#false} is VALID [2022-04-27 15:45:01,989 INFO L290 TraceCheckUtils]: 54: Hoare triple {135084#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,989 INFO L290 TraceCheckUtils]: 55: Hoare triple {135084#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,989 INFO L290 TraceCheckUtils]: 56: Hoare triple {135084#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,989 INFO L290 TraceCheckUtils]: 57: Hoare triple {135084#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,989 INFO L290 TraceCheckUtils]: 58: Hoare triple {135084#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,989 INFO L290 TraceCheckUtils]: 59: Hoare triple {135084#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,989 INFO L290 TraceCheckUtils]: 60: Hoare triple {135084#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,989 INFO L290 TraceCheckUtils]: 61: Hoare triple {135084#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,989 INFO L290 TraceCheckUtils]: 62: Hoare triple {135084#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,989 INFO L290 TraceCheckUtils]: 63: Hoare triple {135084#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,989 INFO L290 TraceCheckUtils]: 64: Hoare triple {135084#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,989 INFO L290 TraceCheckUtils]: 65: Hoare triple {135084#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,990 INFO L290 TraceCheckUtils]: 66: Hoare triple {135084#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,990 INFO L290 TraceCheckUtils]: 67: Hoare triple {135084#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,990 INFO L290 TraceCheckUtils]: 68: Hoare triple {135084#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,990 INFO L290 TraceCheckUtils]: 69: Hoare triple {135084#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,990 INFO L290 TraceCheckUtils]: 70: Hoare triple {135084#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,990 INFO L290 TraceCheckUtils]: 71: Hoare triple {135084#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,990 INFO L290 TraceCheckUtils]: 72: Hoare triple {135084#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,990 INFO L290 TraceCheckUtils]: 73: Hoare triple {135084#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,990 INFO L290 TraceCheckUtils]: 74: Hoare triple {135084#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,990 INFO L290 TraceCheckUtils]: 75: Hoare triple {135084#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,990 INFO L290 TraceCheckUtils]: 76: Hoare triple {135084#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,990 INFO L290 TraceCheckUtils]: 77: Hoare triple {135084#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,991 INFO L290 TraceCheckUtils]: 78: Hoare triple {135084#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,991 INFO L290 TraceCheckUtils]: 79: Hoare triple {135084#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,991 INFO L290 TraceCheckUtils]: 80: Hoare triple {135084#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,991 INFO L290 TraceCheckUtils]: 81: Hoare triple {135084#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,991 INFO L290 TraceCheckUtils]: 82: Hoare triple {135084#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,991 INFO L290 TraceCheckUtils]: 83: Hoare triple {135084#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,991 INFO L290 TraceCheckUtils]: 84: Hoare triple {135084#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,991 INFO L290 TraceCheckUtils]: 85: Hoare triple {135084#false} assume 8656 == #t~mem77;havoc #t~mem77; {135084#false} is VALID [2022-04-27 15:45:01,991 INFO L290 TraceCheckUtils]: 86: Hoare triple {135084#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {135084#false} is VALID [2022-04-27 15:45:01,991 INFO L290 TraceCheckUtils]: 87: Hoare triple {135084#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {135084#false} is VALID [2022-04-27 15:45:01,991 INFO L290 TraceCheckUtils]: 88: Hoare triple {135084#false} assume !(10 == ~blastFlag~0); {135084#false} is VALID [2022-04-27 15:45:01,991 INFO L290 TraceCheckUtils]: 89: Hoare triple {135084#false} assume !(13 == ~blastFlag~0); {135084#false} is VALID [2022-04-27 15:45:01,991 INFO L290 TraceCheckUtils]: 90: Hoare triple {135084#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,992 INFO L290 TraceCheckUtils]: 91: Hoare triple {135084#false} assume !(0 == ~tmp___10~0); {135084#false} is VALID [2022-04-27 15:45:01,992 INFO L290 TraceCheckUtils]: 92: Hoare triple {135084#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,992 INFO L290 TraceCheckUtils]: 93: Hoare triple {135084#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {135084#false} is VALID [2022-04-27 15:45:01,992 INFO L290 TraceCheckUtils]: 94: Hoare triple {135084#false} ~skip~0 := 0; {135084#false} is VALID [2022-04-27 15:45:01,992 INFO L290 TraceCheckUtils]: 95: Hoare triple {135084#false} assume !false; {135084#false} is VALID [2022-04-27 15:45:01,992 INFO L290 TraceCheckUtils]: 96: Hoare triple {135084#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,992 INFO L290 TraceCheckUtils]: 97: Hoare triple {135084#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,992 INFO L290 TraceCheckUtils]: 98: Hoare triple {135084#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,992 INFO L290 TraceCheckUtils]: 99: Hoare triple {135084#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,992 INFO L290 TraceCheckUtils]: 100: Hoare triple {135084#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,992 INFO L290 TraceCheckUtils]: 101: Hoare triple {135084#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,992 INFO L290 TraceCheckUtils]: 102: Hoare triple {135084#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,992 INFO L290 TraceCheckUtils]: 103: Hoare triple {135084#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,993 INFO L290 TraceCheckUtils]: 104: Hoare triple {135084#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,993 INFO L290 TraceCheckUtils]: 105: Hoare triple {135084#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,993 INFO L290 TraceCheckUtils]: 106: Hoare triple {135084#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,993 INFO L290 TraceCheckUtils]: 107: Hoare triple {135084#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,993 INFO L290 TraceCheckUtils]: 108: Hoare triple {135084#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,993 INFO L290 TraceCheckUtils]: 109: Hoare triple {135084#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,993 INFO L290 TraceCheckUtils]: 110: Hoare triple {135084#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,993 INFO L290 TraceCheckUtils]: 111: Hoare triple {135084#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,993 INFO L290 TraceCheckUtils]: 112: Hoare triple {135084#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,993 INFO L290 TraceCheckUtils]: 113: Hoare triple {135084#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,993 INFO L290 TraceCheckUtils]: 114: Hoare triple {135084#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,993 INFO L290 TraceCheckUtils]: 115: Hoare triple {135084#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,994 INFO L290 TraceCheckUtils]: 116: Hoare triple {135084#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,994 INFO L290 TraceCheckUtils]: 117: Hoare triple {135084#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,994 INFO L290 TraceCheckUtils]: 118: Hoare triple {135084#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,994 INFO L290 TraceCheckUtils]: 119: Hoare triple {135084#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,994 INFO L290 TraceCheckUtils]: 120: Hoare triple {135084#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,994 INFO L290 TraceCheckUtils]: 121: Hoare triple {135084#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,994 INFO L290 TraceCheckUtils]: 122: Hoare triple {135084#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,994 INFO L290 TraceCheckUtils]: 123: Hoare triple {135084#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,994 INFO L290 TraceCheckUtils]: 124: Hoare triple {135084#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,994 INFO L290 TraceCheckUtils]: 125: Hoare triple {135084#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,994 INFO L290 TraceCheckUtils]: 126: Hoare triple {135084#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,994 INFO L290 TraceCheckUtils]: 127: Hoare triple {135084#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,995 INFO L290 TraceCheckUtils]: 128: Hoare triple {135084#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,995 INFO L290 TraceCheckUtils]: 129: Hoare triple {135084#false} assume 8672 == #t~mem79;havoc #t~mem79; {135084#false} is VALID [2022-04-27 15:45:01,995 INFO L290 TraceCheckUtils]: 130: Hoare triple {135084#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {135084#false} is VALID [2022-04-27 15:45:01,995 INFO L290 TraceCheckUtils]: 131: Hoare triple {135084#false} assume !(11 == ~blastFlag~0); {135084#false} is VALID [2022-04-27 15:45:01,995 INFO L290 TraceCheckUtils]: 132: Hoare triple {135084#false} assume !(14 == ~blastFlag~0); {135084#false} is VALID [2022-04-27 15:45:01,995 INFO L290 TraceCheckUtils]: 133: Hoare triple {135084#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,995 INFO L290 TraceCheckUtils]: 134: Hoare triple {135084#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {135084#false} is VALID [2022-04-27 15:45:01,995 INFO L290 TraceCheckUtils]: 135: Hoare triple {135084#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,995 INFO L290 TraceCheckUtils]: 136: Hoare triple {135084#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,995 INFO L290 TraceCheckUtils]: 137: Hoare triple {135084#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {135084#false} is VALID [2022-04-27 15:45:01,996 INFO L290 TraceCheckUtils]: 138: Hoare triple {135084#false} ~skip~0 := 0; {135084#false} is VALID [2022-04-27 15:45:01,996 INFO L290 TraceCheckUtils]: 139: Hoare triple {135084#false} assume !false; {135084#false} is VALID [2022-04-27 15:45:01,996 INFO L290 TraceCheckUtils]: 140: Hoare triple {135084#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,996 INFO L290 TraceCheckUtils]: 141: Hoare triple {135084#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,996 INFO L290 TraceCheckUtils]: 142: Hoare triple {135084#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,996 INFO L290 TraceCheckUtils]: 143: Hoare triple {135084#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,996 INFO L290 TraceCheckUtils]: 144: Hoare triple {135084#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,996 INFO L290 TraceCheckUtils]: 145: Hoare triple {135084#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,996 INFO L290 TraceCheckUtils]: 146: Hoare triple {135084#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,996 INFO L290 TraceCheckUtils]: 147: Hoare triple {135084#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,996 INFO L290 TraceCheckUtils]: 148: Hoare triple {135084#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,997 INFO L290 TraceCheckUtils]: 149: Hoare triple {135084#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,997 INFO L290 TraceCheckUtils]: 150: Hoare triple {135084#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,997 INFO L290 TraceCheckUtils]: 151: Hoare triple {135084#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,997 INFO L290 TraceCheckUtils]: 152: Hoare triple {135084#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,997 INFO L290 TraceCheckUtils]: 153: Hoare triple {135084#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,997 INFO L290 TraceCheckUtils]: 154: Hoare triple {135084#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,997 INFO L290 TraceCheckUtils]: 155: Hoare triple {135084#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,997 INFO L290 TraceCheckUtils]: 156: Hoare triple {135084#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,997 INFO L290 TraceCheckUtils]: 157: Hoare triple {135084#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,997 INFO L290 TraceCheckUtils]: 158: Hoare triple {135084#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,997 INFO L290 TraceCheckUtils]: 159: Hoare triple {135084#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,998 INFO L290 TraceCheckUtils]: 160: Hoare triple {135084#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,998 INFO L290 TraceCheckUtils]: 161: Hoare triple {135084#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,998 INFO L290 TraceCheckUtils]: 162: Hoare triple {135084#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,998 INFO L290 TraceCheckUtils]: 163: Hoare triple {135084#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,998 INFO L290 TraceCheckUtils]: 164: Hoare triple {135084#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,998 INFO L290 TraceCheckUtils]: 165: Hoare triple {135084#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,998 INFO L290 TraceCheckUtils]: 166: Hoare triple {135084#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,998 INFO L290 TraceCheckUtils]: 167: Hoare triple {135084#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,998 INFO L290 TraceCheckUtils]: 168: Hoare triple {135084#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {135084#false} is VALID [2022-04-27 15:45:01,998 INFO L290 TraceCheckUtils]: 169: Hoare triple {135084#false} assume 8640 == #t~mem75;havoc #t~mem75; {135084#false} is VALID [2022-04-27 15:45:01,998 INFO L290 TraceCheckUtils]: 170: Hoare triple {135084#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {135084#false} is VALID [2022-04-27 15:45:01,999 INFO L290 TraceCheckUtils]: 171: Hoare triple {135084#false} assume !(9 == ~blastFlag~0); {135084#false} is VALID [2022-04-27 15:45:01,999 INFO L290 TraceCheckUtils]: 172: Hoare triple {135084#false} assume !(12 == ~blastFlag~0); {135084#false} is VALID [2022-04-27 15:45:01,999 INFO L290 TraceCheckUtils]: 173: Hoare triple {135084#false} assume !false; {135084#false} is VALID [2022-04-27 15:45:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-04-27 15:45:01,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:45:01,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50884531] [2022-04-27 15:45:02,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50884531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:45:02,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:45:02,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 15:45:02,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451779004] [2022-04-27 15:45:02,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:45:02,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 174 [2022-04-27 15:45:02,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:45:02,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:02,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:45:02,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 15:45:02,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:45:02,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 15:45:02,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:45:02,069 INFO L87 Difference]: Start difference. First operand 1282 states and 1807 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:05,230 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:45:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:45:10,301 INFO L93 Difference]: Finished difference Result 2557 states and 3606 transitions. [2022-04-27 15:45:10,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:45:10,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 174 [2022-04-27 15:45:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:45:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 442 transitions. [2022-04-27 15:45:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 442 transitions. [2022-04-27 15:45:10,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 442 transitions. [2022-04-27 15:45:10,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:45:10,635 INFO L225 Difference]: With dead ends: 2557 [2022-04-27 15:45:10,635 INFO L226 Difference]: Without dead ends: 1282 [2022-04-27 15:45:10,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 15:45:10,637 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 7 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:45:10,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 891 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-27 15:45:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2022-04-27 15:45:10,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2022-04-27 15:45:10,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:45:10,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1282 states. Second operand has 1282 states, 1277 states have (on average 1.4111198120595145) internal successors, (1802), 1277 states have internal predecessors, (1802), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:10,661 INFO L74 IsIncluded]: Start isIncluded. First operand 1282 states. Second operand has 1282 states, 1277 states have (on average 1.4111198120595145) internal successors, (1802), 1277 states have internal predecessors, (1802), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:10,662 INFO L87 Difference]: Start difference. First operand 1282 states. Second operand has 1282 states, 1277 states have (on average 1.4111198120595145) internal successors, (1802), 1277 states have internal predecessors, (1802), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:10,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:45:10,700 INFO L93 Difference]: Finished difference Result 1282 states and 1806 transitions. [2022-04-27 15:45:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1806 transitions. [2022-04-27 15:45:10,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:45:10,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:45:10,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 1282 states, 1277 states have (on average 1.4111198120595145) internal successors, (1802), 1277 states have internal predecessors, (1802), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1282 states. [2022-04-27 15:45:10,702 INFO L87 Difference]: Start difference. First operand has 1282 states, 1277 states have (on average 1.4111198120595145) internal successors, (1802), 1277 states have internal predecessors, (1802), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1282 states. [2022-04-27 15:45:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:45:10,741 INFO L93 Difference]: Finished difference Result 1282 states and 1806 transitions. [2022-04-27 15:45:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1806 transitions. [2022-04-27 15:45:10,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:45:10,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:45:10,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:45:10,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:45:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1277 states have (on average 1.4111198120595145) internal successors, (1802), 1277 states have internal predecessors, (1802), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1806 transitions. [2022-04-27 15:45:10,789 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1806 transitions. Word has length 174 [2022-04-27 15:45:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:45:10,789 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1806 transitions. [2022-04-27 15:45:10,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:45:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1806 transitions. [2022-04-27 15:45:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-04-27 15:45:10,791 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:45:10,791 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:45:10,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-27 15:45:10,791 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:45:10,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:45:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1221237840, now seen corresponding path program 1 times [2022-04-27 15:45:10,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:45:10,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804167775] [2022-04-27 15:45:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:45:10,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:45:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:45:11,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:45:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:45:11,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {141871#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {141857#true} is VALID [2022-04-27 15:45:11,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {141857#true} assume true; {141857#true} is VALID [2022-04-27 15:45:11,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141857#true} {141857#true} #720#return; {141857#true} is VALID [2022-04-27 15:45:11,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {141857#true} call ULTIMATE.init(); {141871#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:45:11,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {141871#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {141857#true} is VALID [2022-04-27 15:45:11,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {141857#true} assume true; {141857#true} is VALID [2022-04-27 15:45:11,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141857#true} {141857#true} #720#return; {141857#true} is VALID [2022-04-27 15:45:11,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {141857#true} call #t~ret161 := main(); {141857#true} is VALID [2022-04-27 15:45:11,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {141857#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {141862#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (= (select |#valid| main_~s~0.base) 1) (<= main_~s~0.offset 0) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} is VALID [2022-04-27 15:45:11,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {141862#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (= (select |#valid| main_~s~0.base) 1) (<= main_~s~0.offset 0) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {141863#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (<= main_~s~0.offset 0) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} is VALID [2022-04-27 15:45:11,761 INFO L272 TraceCheckUtils]: 7: Hoare triple {141863#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (<= main_~s~0.offset 0) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {141864#(and (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 84 |ssl3_accept_#in~s.offset|)) 0) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 176 |ssl3_accept_#in~s.offset|)))) (<= |ssl3_accept_#in~s.offset| 0))} is VALID [2022-04-27 15:45:11,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {141864#(and (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 84 |ssl3_accept_#in~s.offset|)) 0) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 176 |ssl3_accept_#in~s.offset|)))) (<= |ssl3_accept_#in~s.offset| 0))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !false; {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume 8464 == #t~mem55;havoc #t~mem55; {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:45:11,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {141865#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} ~skip~0 := 0; {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !false; {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,781 INFO L290 TraceCheckUtils]: 36: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,784 INFO L290 TraceCheckUtils]: 42: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,784 INFO L290 TraceCheckUtils]: 43: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 8496 == #t~mem58;havoc #t~mem58; {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,786 INFO L290 TraceCheckUtils]: 46: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,789 INFO L290 TraceCheckUtils]: 50: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,790 INFO L290 TraceCheckUtils]: 51: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,790 INFO L290 TraceCheckUtils]: 52: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} ~skip~0 := 0; {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,791 INFO L290 TraceCheckUtils]: 53: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !false; {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,791 INFO L290 TraceCheckUtils]: 54: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,792 INFO L290 TraceCheckUtils]: 55: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,793 INFO L290 TraceCheckUtils]: 56: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,793 INFO L290 TraceCheckUtils]: 57: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,794 INFO L290 TraceCheckUtils]: 58: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,795 INFO L290 TraceCheckUtils]: 60: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,795 INFO L290 TraceCheckUtils]: 61: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,796 INFO L290 TraceCheckUtils]: 63: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,797 INFO L290 TraceCheckUtils]: 64: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,797 INFO L290 TraceCheckUtils]: 65: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,798 INFO L290 TraceCheckUtils]: 66: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,798 INFO L290 TraceCheckUtils]: 67: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,799 INFO L290 TraceCheckUtils]: 68: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,800 INFO L290 TraceCheckUtils]: 71: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,801 INFO L290 TraceCheckUtils]: 72: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,801 INFO L290 TraceCheckUtils]: 73: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,802 INFO L290 TraceCheckUtils]: 74: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,803 INFO L290 TraceCheckUtils]: 75: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,803 INFO L290 TraceCheckUtils]: 76: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,804 INFO L290 TraceCheckUtils]: 77: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,804 INFO L290 TraceCheckUtils]: 78: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,805 INFO L290 TraceCheckUtils]: 79: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,805 INFO L290 TraceCheckUtils]: 80: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,806 INFO L290 TraceCheckUtils]: 81: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,806 INFO L290 TraceCheckUtils]: 82: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,807 INFO L290 TraceCheckUtils]: 83: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,807 INFO L290 TraceCheckUtils]: 84: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,808 INFO L290 TraceCheckUtils]: 85: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 8656 == #t~mem77;havoc #t~mem77; {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:45:11,809 INFO L290 TraceCheckUtils]: 86: Hoare triple {141866#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,809 INFO L290 TraceCheckUtils]: 87: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,810 INFO L290 TraceCheckUtils]: 88: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(10 == ~blastFlag~0); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,810 INFO L290 TraceCheckUtils]: 89: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(13 == ~blastFlag~0); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,811 INFO L290 TraceCheckUtils]: 90: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,812 INFO L290 TraceCheckUtils]: 91: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(0 == ~tmp___10~0); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,812 INFO L290 TraceCheckUtils]: 92: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,813 INFO L290 TraceCheckUtils]: 93: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,813 INFO L290 TraceCheckUtils]: 94: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} ~skip~0 := 0; {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,814 INFO L290 TraceCheckUtils]: 95: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !false; {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,814 INFO L290 TraceCheckUtils]: 96: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,815 INFO L290 TraceCheckUtils]: 97: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,815 INFO L290 TraceCheckUtils]: 98: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,815 INFO L290 TraceCheckUtils]: 99: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,816 INFO L290 TraceCheckUtils]: 100: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,816 INFO L290 TraceCheckUtils]: 101: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,817 INFO L290 TraceCheckUtils]: 102: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,817 INFO L290 TraceCheckUtils]: 103: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,818 INFO L290 TraceCheckUtils]: 104: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,818 INFO L290 TraceCheckUtils]: 105: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,819 INFO L290 TraceCheckUtils]: 106: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,819 INFO L290 TraceCheckUtils]: 107: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,819 INFO L290 TraceCheckUtils]: 108: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,820 INFO L290 TraceCheckUtils]: 109: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,820 INFO L290 TraceCheckUtils]: 110: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,821 INFO L290 TraceCheckUtils]: 111: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,821 INFO L290 TraceCheckUtils]: 112: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,822 INFO L290 TraceCheckUtils]: 113: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,822 INFO L290 TraceCheckUtils]: 114: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,822 INFO L290 TraceCheckUtils]: 115: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,823 INFO L290 TraceCheckUtils]: 116: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,823 INFO L290 TraceCheckUtils]: 117: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,824 INFO L290 TraceCheckUtils]: 118: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,824 INFO L290 TraceCheckUtils]: 119: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,825 INFO L290 TraceCheckUtils]: 120: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,825 INFO L290 TraceCheckUtils]: 121: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,825 INFO L290 TraceCheckUtils]: 122: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,826 INFO L290 TraceCheckUtils]: 123: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,826 INFO L290 TraceCheckUtils]: 124: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,827 INFO L290 TraceCheckUtils]: 125: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,827 INFO L290 TraceCheckUtils]: 126: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,828 INFO L290 TraceCheckUtils]: 127: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,828 INFO L290 TraceCheckUtils]: 128: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,829 INFO L290 TraceCheckUtils]: 129: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume 8672 == #t~mem79;havoc #t~mem79; {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,829 INFO L290 TraceCheckUtils]: 130: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,829 INFO L290 TraceCheckUtils]: 131: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(11 == ~blastFlag~0); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,830 INFO L290 TraceCheckUtils]: 132: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(14 == ~blastFlag~0); {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:45:11,831 INFO L290 TraceCheckUtils]: 133: Hoare triple {141867#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {141868#(and (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))) (not (= (+ (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 792) ssl3_accept_~s.offset)))} is VALID [2022-04-27 15:45:11,832 INFO L290 TraceCheckUtils]: 134: Hoare triple {141868#(and (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))) (not (= (+ (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 792) ssl3_accept_~s.offset)))} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,833 INFO L290 TraceCheckUtils]: 135: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,833 INFO L290 TraceCheckUtils]: 136: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,833 INFO L290 TraceCheckUtils]: 137: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,834 INFO L290 TraceCheckUtils]: 138: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,834 INFO L290 TraceCheckUtils]: 139: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,835 INFO L290 TraceCheckUtils]: 140: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,835 INFO L290 TraceCheckUtils]: 141: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,836 INFO L290 TraceCheckUtils]: 142: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,836 INFO L290 TraceCheckUtils]: 143: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,836 INFO L290 TraceCheckUtils]: 144: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,837 INFO L290 TraceCheckUtils]: 145: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,837 INFO L290 TraceCheckUtils]: 146: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,838 INFO L290 TraceCheckUtils]: 147: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,838 INFO L290 TraceCheckUtils]: 148: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,838 INFO L290 TraceCheckUtils]: 149: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,839 INFO L290 TraceCheckUtils]: 150: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,839 INFO L290 TraceCheckUtils]: 151: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,840 INFO L290 TraceCheckUtils]: 152: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,840 INFO L290 TraceCheckUtils]: 153: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,841 INFO L290 TraceCheckUtils]: 154: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,841 INFO L290 TraceCheckUtils]: 155: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,841 INFO L290 TraceCheckUtils]: 156: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,842 INFO L290 TraceCheckUtils]: 157: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,842 INFO L290 TraceCheckUtils]: 158: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,843 INFO L290 TraceCheckUtils]: 159: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,843 INFO L290 TraceCheckUtils]: 160: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:45:11,843 INFO L290 TraceCheckUtils]: 161: Hoare triple {141869#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {141870#(= 8448 |ssl3_accept_#t~mem68|)} is VALID [2022-04-27 15:45:11,844 INFO L290 TraceCheckUtils]: 162: Hoare triple {141870#(= 8448 |ssl3_accept_#t~mem68|)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {141858#false} is VALID [2022-04-27 15:45:11,844 INFO L290 TraceCheckUtils]: 163: Hoare triple {141858#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {141858#false} is VALID [2022-04-27 15:45:11,844 INFO L290 TraceCheckUtils]: 164: Hoare triple {141858#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {141858#false} is VALID [2022-04-27 15:45:11,844 INFO L290 TraceCheckUtils]: 165: Hoare triple {141858#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {141858#false} is VALID [2022-04-27 15:45:11,844 INFO L290 TraceCheckUtils]: 166: Hoare triple {141858#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {141858#false} is VALID [2022-04-27 15:45:11,844 INFO L290 TraceCheckUtils]: 167: Hoare triple {141858#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {141858#false} is VALID [2022-04-27 15:45:11,844 INFO L290 TraceCheckUtils]: 168: Hoare triple {141858#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {141858#false} is VALID [2022-04-27 15:45:11,844 INFO L290 TraceCheckUtils]: 169: Hoare triple {141858#false} assume 8640 == #t~mem75;havoc #t~mem75; {141858#false} is VALID [2022-04-27 15:45:11,844 INFO L290 TraceCheckUtils]: 170: Hoare triple {141858#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {141858#false} is VALID [2022-04-27 15:45:11,845 INFO L290 TraceCheckUtils]: 171: Hoare triple {141858#false} assume !(9 == ~blastFlag~0); {141858#false} is VALID [2022-04-27 15:45:11,845 INFO L290 TraceCheckUtils]: 172: Hoare triple {141858#false} assume !(12 == ~blastFlag~0); {141858#false} is VALID [2022-04-27 15:45:11,845 INFO L290 TraceCheckUtils]: 173: Hoare triple {141858#false} assume !false; {141858#false} is VALID [2022-04-27 15:45:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 169 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 15:45:11,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:45:11,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804167775] [2022-04-27 15:45:11,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804167775] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:45:11,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438415063] [2022-04-27 15:45:11,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:45:11,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:45:11,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:45:11,851 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 15:45:11,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 15:45:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:45:12,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 212 conjunts are in the unsatisfiable core [2022-04-27 15:45:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:45:12,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:45:14,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28153 treesize of output 23896 [2022-04-27 15:45:14,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:45:14,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10709 treesize of output 1662 [2022-04-27 15:45:19,245 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-27 15:45:19,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 15:45:19,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-27 15:45:19,472 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_2 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:825) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:786) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:704) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:250) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-27 15:45:19,475 INFO L158 Benchmark]: Toolchain (without parser) took 316480.21ms. Allocated memory was 186.6MB in the beginning and 276.8MB in the end (delta: 90.2MB). Free memory was 130.8MB in the beginning and 96.8MB in the end (delta: 34.0MB). Peak memory consumption was 166.9MB. Max. memory is 8.0GB. [2022-04-27 15:45:19,475 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 186.6MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:45:19,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.81ms. Allocated memory was 186.6MB in the beginning and 230.7MB in the end (delta: 44.0MB). Free memory was 130.7MB in the beginning and 181.9MB in the end (delta: -51.3MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. [2022-04-27 15:45:19,475 INFO L158 Benchmark]: Boogie Preprocessor took 125.00ms. Allocated memory is still 230.7MB. Free memory was 181.9MB in the beginning and 172.0MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 15:45:19,475 INFO L158 Benchmark]: RCFGBuilder took 1664.19ms. Allocated memory is still 230.7MB. Free memory was 172.0MB in the beginning and 77.6MB in the end (delta: 94.4MB). Peak memory consumption was 94.4MB. Max. memory is 8.0GB. [2022-04-27 15:45:19,475 INFO L158 Benchmark]: TraceAbstraction took 314133.10ms. Allocated memory was 230.7MB in the beginning and 276.8MB in the end (delta: 46.1MB). Free memory was 77.1MB in the beginning and 96.8MB in the end (delta: -19.7MB). Peak memory consumption was 68.9MB. Max. memory is 8.0GB. [2022-04-27 15:45:19,476 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 186.6MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 552.81ms. Allocated memory was 186.6MB in the beginning and 230.7MB in the end (delta: 44.0MB). Free memory was 130.7MB in the beginning and 181.9MB in the end (delta: -51.3MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 125.00ms. Allocated memory is still 230.7MB. Free memory was 181.9MB in the beginning and 172.0MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1664.19ms. Allocated memory is still 230.7MB. Free memory was 172.0MB in the beginning and 77.6MB in the end (delta: 94.4MB). Peak memory consumption was 94.4MB. Max. memory is 8.0GB. * TraceAbstraction took 314133.10ms. Allocated memory was 230.7MB in the beginning and 276.8MB in the end (delta: 46.1MB). Free memory was 77.1MB in the beginning and 96.8MB in the end (delta: -19.7MB). Peak memory consumption was 68.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_2 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_2: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-27 15:45:19,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...