/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.11.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:34:28,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:34:28,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:34:28,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:34:28,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:34:28,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:34:28,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:34:28,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:34:28,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:34:28,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:34:28,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:34:28,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:34:28,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:34:28,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:34:28,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:34:28,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:34:28,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:34:28,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:34:28,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:34:28,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:34:28,083 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:34:28,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:34:28,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:34:28,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:34:28,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:34:28,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:34:28,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:34:28,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:34:28,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:34:28,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:34:28,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:34:28,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:34:28,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:34:28,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:34:28,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:34:28,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:34:28,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:34:28,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:34:28,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:34:28,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:34:28,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:34:28,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:34:28,096 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:34:28,109 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:34:28,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:34:28,109 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:34:28,109 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:34:28,110 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:34:28,110 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:34:28,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:34:28,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:34:28,110 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:34:28,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:34:28,111 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:34:28,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:34:28,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:34:28,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:34:28,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:34:28,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:34:28,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:34:28,112 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:34:28,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:34:28,112 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:34:28,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:34:28,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:34:28,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:34:28,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:34:28,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:34:28,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:34:28,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:34:28,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:34:28,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:34:28,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:34:28,113 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:34:28,113 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:34:28,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:34:28,113 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:34:28,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:34:28,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:34:28,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:34:28,324 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:34:28,324 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:34:28,325 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.11.i.cil-1.c [2022-04-27 15:34:28,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29cae455b/cfd9339205904e9190b9d44e801bdde4/FLAG007979552 [2022-04-27 15:34:28,852 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:34:28,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.11.i.cil-1.c [2022-04-27 15:34:28,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29cae455b/cfd9339205904e9190b9d44e801bdde4/FLAG007979552 [2022-04-27 15:34:28,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29cae455b/cfd9339205904e9190b9d44e801bdde4 [2022-04-27 15:34:28,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:34:28,887 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:34:28,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:34:28,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:34:28,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:34:28,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:34:28" (1/1) ... [2022-04-27 15:34:28,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d06c5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:34:28, skipping insertion in model container [2022-04-27 15:34:28,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:34:28" (1/1) ... [2022-04-27 15:34:28,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:34:28,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:34:29,233 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.11.i.cil-1.c[74369,74382] [2022-04-27 15:34:29,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:34:29,257 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:34:29,332 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.11.i.cil-1.c[74369,74382] [2022-04-27 15:34:29,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:34:29,346 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:34:29,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:34:29 WrapperNode [2022-04-27 15:34:29,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:34:29,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:34:29,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:34:29,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:34:29,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:34:29" (1/1) ... [2022-04-27 15:34:29,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:34:29" (1/1) ... [2022-04-27 15:34:29,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:34:29" (1/1) ... [2022-04-27 15:34:29,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:34:29" (1/1) ... [2022-04-27 15:34:29,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:34:29" (1/1) ... [2022-04-27 15:34:29,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:34:29" (1/1) ... [2022-04-27 15:34:29,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:34:29" (1/1) ... [2022-04-27 15:34:29,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:34:29,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:34:29,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:34:29,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:34:29,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:34:29" (1/1) ... [2022-04-27 15:34:29,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:34:29,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:34:29,492 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:34:29,503 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:34:29,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:34:29,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:34:29,522 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:34:29,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-27 15:34:29,524 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-27 15:34:29,524 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:34:29,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-27 15:34:29,524 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-27 15:34:29,525 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 15:34:29,525 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-27 15:34:29,525 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:34:29,525 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:34:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:34:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:34:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-27 15:34:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 15:34:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:34:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-27 15:34:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-27 15:34:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-27 15:34:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-27 15:34:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-27 15:34:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-27 15:34:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-27 15:34:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-27 15:34:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-27 15:34:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:34:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 15:34:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:34:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-27 15:34:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:34:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 15:34:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 15:34:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:34:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:34:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:34:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-27 15:34:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-27 15:34:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-27 15:34:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-27 15:34:29,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:34:29,686 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:34:29,687 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:34:30,556 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-27 15:34:31,029 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-27 15:34:31,030 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-27 15:34:31,039 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:34:31,048 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:34:31,048 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:34:31,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:34:31 BoogieIcfgContainer [2022-04-27 15:34:31,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:34:31,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:34:31,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:34:31,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:34:31,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:34:28" (1/3) ... [2022-04-27 15:34:31,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feea777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:34:31, skipping insertion in model container [2022-04-27 15:34:31,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:34:29" (2/3) ... [2022-04-27 15:34:31,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feea777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:34:31, skipping insertion in model container [2022-04-27 15:34:31,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:34:31" (3/3) ... [2022-04-27 15:34:31,057 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2022-04-27 15:34:31,066 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:34:31,067 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:34:31,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:34:31,117 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@59e3a4f0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c30b681 [2022-04-27 15:34:31,118 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:34:31,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 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:34:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 15:34:31,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:34:31,130 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] [2022-04-27 15:34:31,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:34:31,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:34:31,134 INFO L85 PathProgramCache]: Analyzing trace with hash -671352377, now seen corresponding path program 1 times [2022-04-27 15:34:31,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:34:31,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234336412] [2022-04-27 15:34:31,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:34:31,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:34:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:31,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:34:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:31,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(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); {161#true} is VALID [2022-04-27 15:34:31,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-27 15:34:31,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #690#return; {161#true} is VALID [2022-04-27 15:34:31,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {168#(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:34:31,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(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); {161#true} is VALID [2022-04-27 15:34:31,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-27 15:34:31,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #690#return; {161#true} is VALID [2022-04-27 15:34:31,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-27 15:34:31,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#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; {161#true} is VALID [2022-04-27 15:34:31,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {161#true} is VALID [2022-04-27 15:34:31,511 INFO L272 TraceCheckUtils]: 7: Hoare triple {161#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {161#true} is VALID [2022-04-27 15:34:31,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(not (= 8544 (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; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(not (= 8544 (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; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= 8544 (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)))); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#(not (= 8544 (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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#(not (= 8544 (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; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#(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); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:31,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#(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); {167#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-27 15:34:31,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {167#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {162#false} is VALID [2022-04-27 15:34:31,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {162#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {162#false} is VALID [2022-04-27 15:34:31,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {162#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); {162#false} is VALID [2022-04-27 15:34:31,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {162#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {162#false} is VALID [2022-04-27 15:34:31,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {162#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); {162#false} is VALID [2022-04-27 15:34:31,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {162#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; {162#false} is VALID [2022-04-27 15:34:31,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {162#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; {162#false} is VALID [2022-04-27 15:34:31,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 7 == ~blastFlag~0; {162#false} is VALID [2022-04-27 15:34:31,536 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-27 15:34:31,537 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:34:31,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:34:31,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234336412] [2022-04-27 15:34:31,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234336412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:34:31,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:34:31,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:34:31,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454471558] [2022-04-27 15:34:31,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:34:31,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 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 42 [2022-04-27 15:34:31,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:34:31,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 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:34:31,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:34:31,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:34:31,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:34:31,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:34:31,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:34:31,632 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 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 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 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:34:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:35,919 INFO L93 Difference]: Finished difference Result 430 states and 727 transitions. [2022-04-27 15:34:35,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:34:35,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 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 42 [2022-04-27 15:34:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:34:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 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:34:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-27 15:34:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 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:34:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-27 15:34:35,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 727 transitions. [2022-04-27 15:34:36,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:34:36,443 INFO L225 Difference]: With dead ends: 430 [2022-04-27 15:34:36,443 INFO L226 Difference]: Without dead ends: 261 [2022-04-27 15:34:36,446 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:34:36,448 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 167 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:34:36,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 461 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-27 15:34:36,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-27 15:34:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 170. [2022-04-27 15:34:36,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:34:36,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 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:34:36,478 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 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:34:36,479 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 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:34:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:36,487 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-27 15:34:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-27 15:34:36,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:34:36,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:34:36,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 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 261 states. [2022-04-27 15:34:36,489 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 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 261 states. [2022-04-27 15:34:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:36,497 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-27 15:34:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-27 15:34:36,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:34:36,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:34:36,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:34:36,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:34:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 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:34:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-27 15:34:36,505 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-27 15:34:36,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:34:36,505 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-27 15:34:36,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 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:34:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-27 15:34:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 15:34:36,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:34:36,507 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] [2022-04-27 15:34:36,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:34:36,507 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:34:36,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:34:36,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1244096364, now seen corresponding path program 1 times [2022-04-27 15:34:36,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:34:36,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474091402] [2022-04-27 15:34:36,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:34:36,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:34:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:36,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:34:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:36,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {1417#(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); {1410#true} is VALID [2022-04-27 15:34:36,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {1410#true} assume true; {1410#true} is VALID [2022-04-27 15:34:36,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1410#true} {1410#true} #690#return; {1410#true} is VALID [2022-04-27 15:34:36,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {1410#true} call ULTIMATE.init(); {1417#(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:34:36,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {1417#(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); {1410#true} is VALID [2022-04-27 15:34:36,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {1410#true} assume true; {1410#true} is VALID [2022-04-27 15:34:36,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1410#true} {1410#true} #690#return; {1410#true} is VALID [2022-04-27 15:34:36,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {1410#true} call #t~ret161 := main(); {1410#true} is VALID [2022-04-27 15:34:36,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {1410#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; {1410#true} is VALID [2022-04-27 15:34:36,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1410#true} is VALID [2022-04-27 15:34:36,677 INFO L272 TraceCheckUtils]: 7: Hoare triple {1410#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1410#true} is VALID [2022-04-27 15:34:36,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {1410#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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {1415#(not (= 8545 (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; {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {1415#(not (= 8545 (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; {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {1415#(not (= 8545 (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)))); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {1415#(not (= 8545 (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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {1415#(not (= 8545 (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; {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {1415#(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); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:36,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {1415#(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); {1416#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-27 15:34:36,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {1416#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {1411#false} is VALID [2022-04-27 15:34:36,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {1411#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {1411#false} is VALID [2022-04-27 15:34:36,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {1411#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); {1411#false} is VALID [2022-04-27 15:34:36,691 INFO L290 TraceCheckUtils]: 37: Hoare triple {1411#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {1411#false} is VALID [2022-04-27 15:34:36,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {1411#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); {1411#false} is VALID [2022-04-27 15:34:36,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {1411#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; {1411#false} is VALID [2022-04-27 15:34:36,691 INFO L290 TraceCheckUtils]: 40: Hoare triple {1411#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; {1411#false} is VALID [2022-04-27 15:34:36,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {1411#false} assume 7 == ~blastFlag~0; {1411#false} is VALID [2022-04-27 15:34:36,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2022-04-27 15:34:36,692 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:34:36,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:34:36,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474091402] [2022-04-27 15:34:36,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474091402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:34:36,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:34:36,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:34:36,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117620974] [2022-04-27 15:34:36,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:34:36,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 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 43 [2022-04-27 15:34:36,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:34:36,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 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:34:36,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:34:36,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:34:36,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:34:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:34:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:34:36,726 INFO L87 Difference]: Start difference. First operand 170 states and 265 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 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:34:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:40,618 INFO L93 Difference]: Finished difference Result 444 states and 697 transitions. [2022-04-27 15:34:40,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:34:40,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 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 43 [2022-04-27 15:34:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:34:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 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:34:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-27 15:34:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 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:34:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-27 15:34:40,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-27 15:34:41,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:34:41,080 INFO L225 Difference]: With dead ends: 444 [2022-04-27 15:34:41,080 INFO L226 Difference]: Without dead ends: 289 [2022-04-27 15:34:41,081 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:34:41,082 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 134 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:34:41,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 15:34:41,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-27 15:34:41,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 199. [2022-04-27 15:34:41,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:34:41,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 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:34:41,092 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 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:34:41,092 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 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:34:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:41,099 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-27 15:34:41,100 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-27 15:34:41,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:34:41,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:34:41,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 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 289 states. [2022-04-27 15:34:41,101 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 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 289 states. [2022-04-27 15:34:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:41,110 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-27 15:34:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-27 15:34:41,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:34:41,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:34:41,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:34:41,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:34:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 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:34:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-27 15:34:41,118 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-27 15:34:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:34:41,119 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-27 15:34:41,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 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:34:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-27 15:34:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 15:34:41,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:34:41,121 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:34:41,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:34:41,124 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:34:41,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:34:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1913847322, now seen corresponding path program 1 times [2022-04-27 15:34:41,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:34:41,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689386625] [2022-04-27 15:34:41,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:34:41,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:34:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:34:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:41,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {2762#(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); {2755#true} is VALID [2022-04-27 15:34:41,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {2755#true} assume true; {2755#true} is VALID [2022-04-27 15:34:41,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2755#true} {2755#true} #690#return; {2755#true} is VALID [2022-04-27 15:34:41,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {2755#true} call ULTIMATE.init(); {2762#(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:34:41,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {2762#(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); {2755#true} is VALID [2022-04-27 15:34:41,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {2755#true} assume true; {2755#true} is VALID [2022-04-27 15:34:41,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2755#true} {2755#true} #690#return; {2755#true} is VALID [2022-04-27 15:34:41,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {2755#true} call #t~ret161 := main(); {2755#true} is VALID [2022-04-27 15:34:41,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {2755#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; {2755#true} is VALID [2022-04-27 15:34:41,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {2755#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2755#true} is VALID [2022-04-27 15:34:41,268 INFO L272 TraceCheckUtils]: 7: Hoare triple {2755#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2755#true} is VALID [2022-04-27 15:34:41,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {2755#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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {2760#(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; {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {2760#(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; {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {2760#(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)))); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {2760#(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; {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,297 INFO L290 TraceCheckUtils]: 39: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,297 INFO L290 TraceCheckUtils]: 40: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {2760#(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); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:41,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {2760#(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); {2761#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-27 15:34:41,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {2761#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {2756#false} is VALID [2022-04-27 15:34:41,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {2756#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {2756#false} is VALID [2022-04-27 15:34:41,301 INFO L290 TraceCheckUtils]: 46: Hoare triple {2756#false} assume !(4 == ~blastFlag~0); {2756#false} is VALID [2022-04-27 15:34:41,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {2756#false} assume 5 == ~blastFlag~0; {2756#false} is VALID [2022-04-27 15:34:41,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {2756#false} assume !false; {2756#false} is VALID [2022-04-27 15:34:41,302 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:34:41,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:34:41,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689386625] [2022-04-27 15:34:41,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689386625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:34:41,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:34:41,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:34:41,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163352669] [2022-04-27 15:34:41,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:34:41,303 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:34:41,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:34:41,304 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:34:41,338 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:34:41,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:34:41,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:34:41,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:34:41,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:34:41,340 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. 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:34:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:46,211 INFO L93 Difference]: Finished difference Result 503 states and 800 transitions. [2022-04-27 15:34:46,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:34:46,211 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:34:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:34:46,213 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:34:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-27 15:34:46,217 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:34:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-27 15:34:46,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-27 15:34:46,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:34:46,606 INFO L225 Difference]: With dead ends: 503 [2022-04-27 15:34:46,606 INFO L226 Difference]: Without dead ends: 319 [2022-04-27 15:34:46,607 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:34:46,608 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 123 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:34:46,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 344 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-27 15:34:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-27 15:34:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 239. [2022-04-27 15:34:46,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:34:46,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 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:34:46,616 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 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:34:46,617 INFO L87 Difference]: Start difference. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 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:34:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:46,623 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-27 15:34:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-27 15:34:46,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:34:46,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:34:46,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 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 319 states. [2022-04-27 15:34:46,624 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 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 319 states. [2022-04-27 15:34:46,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:46,630 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-27 15:34:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-27 15:34:46,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:34:46,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:34:46,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:34:46,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:34:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 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:34:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-27 15:34:46,635 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 49 [2022-04-27 15:34:46,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:34:46,635 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-27 15:34:46,635 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:34:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-27 15:34:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 15:34:46,636 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:34:46,636 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:34:46,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:34:46,636 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:34:46,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:34:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1017457862, now seen corresponding path program 1 times [2022-04-27 15:34:46,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:34:46,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626644433] [2022-04-27 15:34:46,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:34:46,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:34:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:46,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:34:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:46,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {4272#(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); {4265#true} is VALID [2022-04-27 15:34:46,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {4265#true} assume true; {4265#true} is VALID [2022-04-27 15:34:46,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4265#true} {4265#true} #690#return; {4265#true} is VALID [2022-04-27 15:34:46,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {4265#true} call ULTIMATE.init(); {4272#(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:34:46,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {4272#(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); {4265#true} is VALID [2022-04-27 15:34:46,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {4265#true} assume true; {4265#true} is VALID [2022-04-27 15:34:46,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4265#true} {4265#true} #690#return; {4265#true} is VALID [2022-04-27 15:34:46,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {4265#true} call #t~ret161 := main(); {4265#true} is VALID [2022-04-27 15:34:46,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {4265#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; {4265#true} is VALID [2022-04-27 15:34:46,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {4265#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4265#true} is VALID [2022-04-27 15:34:46,738 INFO L272 TraceCheckUtils]: 7: Hoare triple {4265#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4265#true} is VALID [2022-04-27 15:34:46,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {4265#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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {4270#(not (= 8641 (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; {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {4270#(not (= 8641 (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; {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {4270#(not (= 8641 (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)))); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {4270#(not (= 8641 (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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {4270#(not (= 8641 (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; {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {4270#(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); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:34:46,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {4270#(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); {4271#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-27 15:34:46,753 INFO L290 TraceCheckUtils]: 45: Hoare triple {4271#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {4266#false} is VALID [2022-04-27 15:34:46,753 INFO L290 TraceCheckUtils]: 46: Hoare triple {4266#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {4266#false} is VALID [2022-04-27 15:34:46,753 INFO L290 TraceCheckUtils]: 47: Hoare triple {4266#false} assume !(4 == ~blastFlag~0); {4266#false} is VALID [2022-04-27 15:34:46,753 INFO L290 TraceCheckUtils]: 48: Hoare triple {4266#false} assume 5 == ~blastFlag~0; {4266#false} is VALID [2022-04-27 15:34:46,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {4266#false} assume !false; {4266#false} is VALID [2022-04-27 15:34:46,753 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:34:46,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:34:46,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626644433] [2022-04-27 15:34:46,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626644433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:34:46,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:34:46,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:34:46,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550356139] [2022-04-27 15:34:46,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:34:46,754 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:34:46,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:34:46,755 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:34:46,789 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:34:46,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:34:46,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:34:46,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:34:46,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:34:46,793 INFO L87 Difference]: Start difference. First operand 239 states and 388 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:34:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:53,250 INFO L93 Difference]: Finished difference Result 553 states and 890 transitions. [2022-04-27 15:34:53,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:34:53,250 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:34:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:34:53,251 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:34:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2022-04-27 15:34:53,254 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:34:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2022-04-27 15:34:53,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 596 transitions. [2022-04-27 15:34:53,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 596 edges. 596 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:34:53,635 INFO L225 Difference]: With dead ends: 553 [2022-04-27 15:34:53,636 INFO L226 Difference]: Without dead ends: 329 [2022-04-27 15:34:53,636 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:34:53,637 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 122 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:34:53,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 364 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-27 15:34:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-27 15:34:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 250. [2022-04-27 15:34:53,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:34:53,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 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:34:53,645 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 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:34:53,645 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 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:34:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:53,650 INFO L93 Difference]: Finished difference Result 329 states and 520 transitions. [2022-04-27 15:34:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 520 transitions. [2022-04-27 15:34:53,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:34:53,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:34:53,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 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 329 states. [2022-04-27 15:34:53,652 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 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 329 states. [2022-04-27 15:34:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:53,657 INFO L93 Difference]: Finished difference Result 329 states and 520 transitions. [2022-04-27 15:34:53,658 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 520 transitions. [2022-04-27 15:34:53,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:34:53,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:34:53,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:34:53,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:34:53,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 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:34:53,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 409 transitions. [2022-04-27 15:34:53,663 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 409 transitions. Word has length 50 [2022-04-27 15:34:53,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:34:53,663 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 409 transitions. [2022-04-27 15:34:53,663 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:34:53,663 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 409 transitions. [2022-04-27 15:34:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-27 15:34:53,664 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:34:53,664 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-27 15:34:53,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:34:53,664 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:34:53,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:34:53,664 INFO L85 PathProgramCache]: Analyzing trace with hash -16045120, now seen corresponding path program 1 times [2022-04-27 15:34:53,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:34:53,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081645850] [2022-04-27 15:34:53,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:34:53,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:34:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:53,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:34:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:53,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {5865#(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); {5858#true} is VALID [2022-04-27 15:34:53,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {5858#true} assume true; {5858#true} is VALID [2022-04-27 15:34:53,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5858#true} {5858#true} #690#return; {5858#true} is VALID [2022-04-27 15:34:53,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {5858#true} call ULTIMATE.init(); {5865#(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:34:53,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {5865#(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); {5858#true} is VALID [2022-04-27 15:34:53,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {5858#true} assume true; {5858#true} is VALID [2022-04-27 15:34:53,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5858#true} {5858#true} #690#return; {5858#true} is VALID [2022-04-27 15:34:53,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {5858#true} call #t~ret161 := main(); {5858#true} is VALID [2022-04-27 15:34:53,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {5858#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; {5858#true} is VALID [2022-04-27 15:34:53,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {5858#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5858#true} is VALID [2022-04-27 15:34:53,805 INFO L272 TraceCheckUtils]: 7: Hoare triple {5858#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5858#true} is VALID [2022-04-27 15:34:53,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {5858#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); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {5863#(= 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; {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {5863#(= 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; {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {5863#(= 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)))); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {5863#(= 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); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {5863#(= 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; {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {5863#(= 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); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {5863#(= 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); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {5863#(= 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); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {5863#(= 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); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {5863#(= 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); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {5863#(= 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); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {5863#(= 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); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {5863#(= 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); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:53,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {5863#(= 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); {5864#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-27 15:34:53,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {5864#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {5859#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {5859#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {5859#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {5859#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {5859#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {5859#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {5859#false} assume 8528 == #t~mem62;havoc #t~mem62; {5859#false} is VALID [2022-04-27 15:34:53,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {5859#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); {5859#false} is VALID [2022-04-27 15:34:53,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {5859#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; {5859#false} is VALID [2022-04-27 15:34:53,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {5859#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); {5859#false} is VALID [2022-04-27 15:34:53,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {5859#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {5859#false} is VALID [2022-04-27 15:34:53,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {5859#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {5859#false} is VALID [2022-04-27 15:34:53,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {5859#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {5859#false} is VALID [2022-04-27 15:34:53,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {5859#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {5859#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); {5859#false} is VALID [2022-04-27 15:34:53,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {5859#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5859#false} is VALID [2022-04-27 15:34:53,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {5859#false} ~skip~0 := 0; {5859#false} is VALID [2022-04-27 15:34:53,815 INFO L290 TraceCheckUtils]: 42: Hoare triple {5859#false} assume !false; {5859#false} is VALID [2022-04-27 15:34:53,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {5859#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); {5859#false} is VALID [2022-04-27 15:34:53,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {5859#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {5859#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {5859#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {5859#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,824 INFO L290 TraceCheckUtils]: 48: Hoare triple {5859#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,824 INFO L290 TraceCheckUtils]: 49: Hoare triple {5859#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,824 INFO L290 TraceCheckUtils]: 50: Hoare triple {5859#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {5859#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {5859#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,825 INFO L290 TraceCheckUtils]: 53: Hoare triple {5859#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,825 INFO L290 TraceCheckUtils]: 54: Hoare triple {5859#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,826 INFO L290 TraceCheckUtils]: 55: Hoare triple {5859#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,827 INFO L290 TraceCheckUtils]: 56: Hoare triple {5859#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,827 INFO L290 TraceCheckUtils]: 57: Hoare triple {5859#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,828 INFO L290 TraceCheckUtils]: 58: Hoare triple {5859#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,828 INFO L290 TraceCheckUtils]: 59: Hoare triple {5859#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,828 INFO L290 TraceCheckUtils]: 60: Hoare triple {5859#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,828 INFO L290 TraceCheckUtils]: 61: Hoare triple {5859#false} assume 8544 == #t~mem64;havoc #t~mem64; {5859#false} is VALID [2022-04-27 15:34:53,828 INFO L290 TraceCheckUtils]: 62: Hoare triple {5859#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:34:53,828 INFO L290 TraceCheckUtils]: 63: Hoare triple {5859#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); {5859#false} is VALID [2022-04-27 15:34:53,828 INFO L290 TraceCheckUtils]: 64: Hoare triple {5859#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {5859#false} is VALID [2022-04-27 15:34:53,828 INFO L290 TraceCheckUtils]: 65: Hoare triple {5859#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); {5859#false} is VALID [2022-04-27 15:34:53,828 INFO L290 TraceCheckUtils]: 66: Hoare triple {5859#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; {5859#false} is VALID [2022-04-27 15:34:53,828 INFO L290 TraceCheckUtils]: 67: Hoare triple {5859#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; {5859#false} is VALID [2022-04-27 15:34:53,828 INFO L290 TraceCheckUtils]: 68: Hoare triple {5859#false} assume 7 == ~blastFlag~0; {5859#false} is VALID [2022-04-27 15:34:53,828 INFO L290 TraceCheckUtils]: 69: Hoare triple {5859#false} assume !false; {5859#false} is VALID [2022-04-27 15:34:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 15:34:53,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:34:53,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081645850] [2022-04-27 15:34:53,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081645850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:34:53,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:34:53,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:34:53,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367259484] [2022-04-27 15:34:53,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:34:53,830 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 70 [2022-04-27 15:34:53,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:34:53,830 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:34:53,871 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:34:53,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:34:53,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:34:53,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:34:53,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:34:53,872 INFO L87 Difference]: Start difference. First operand 250 states and 409 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:34:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:58,465 INFO L93 Difference]: Finished difference Result 513 states and 840 transitions. [2022-04-27 15:34:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:34:58,465 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 70 [2022-04-27 15:34:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:34:58,465 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:34:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-27 15:34:58,468 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:34:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-27 15:34:58,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-27 15:34:58,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:34:58,778 INFO L225 Difference]: With dead ends: 513 [2022-04-27 15:34:58,778 INFO L226 Difference]: Without dead ends: 278 [2022-04-27 15:34:58,778 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:34:58,779 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:34:58,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 481 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 15:34:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-27 15:34:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 261. [2022-04-27 15:34:58,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:34:58,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 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:34:58,794 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 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:34:58,794 INFO L87 Difference]: Start difference. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 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:34:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:58,799 INFO L93 Difference]: Finished difference Result 278 states and 449 transitions. [2022-04-27 15:34:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 449 transitions. [2022-04-27 15:34:58,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:34:58,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:34:58,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 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 278 states. [2022-04-27 15:34:58,801 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 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 278 states. [2022-04-27 15:34:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:58,808 INFO L93 Difference]: Finished difference Result 278 states and 449 transitions. [2022-04-27 15:34:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 449 transitions. [2022-04-27 15:34:58,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:34:58,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:34:58,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:34:58,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:34:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 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:34:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 428 transitions. [2022-04-27 15:34:58,814 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 428 transitions. Word has length 70 [2022-04-27 15:34:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:34:58,814 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 428 transitions. [2022-04-27 15:34:58,814 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:34:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 428 transitions. [2022-04-27 15:34:58,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-27 15:34:58,815 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:34:58,815 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-04-27 15:34:58,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:34:58,816 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:34:58,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:34:58,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1233059435, now seen corresponding path program 1 times [2022-04-27 15:34:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:34:58,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512200495] [2022-04-27 15:34:58,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:34:58,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:34:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:58,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:34:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:58,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {7313#(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); {7306#true} is VALID [2022-04-27 15:34:58,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {7306#true} assume true; {7306#true} is VALID [2022-04-27 15:34:58,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7306#true} {7306#true} #690#return; {7306#true} is VALID [2022-04-27 15:34:58,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {7306#true} call ULTIMATE.init(); {7313#(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:34:58,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {7313#(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); {7306#true} is VALID [2022-04-27 15:34:58,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {7306#true} assume true; {7306#true} is VALID [2022-04-27 15:34:58,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7306#true} {7306#true} #690#return; {7306#true} is VALID [2022-04-27 15:34:58,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {7306#true} call #t~ret161 := main(); {7306#true} is VALID [2022-04-27 15:34:58,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {7306#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; {7306#true} is VALID [2022-04-27 15:34:58,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {7306#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {7306#true} is VALID [2022-04-27 15:34:58,956 INFO L272 TraceCheckUtils]: 7: Hoare triple {7306#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7306#true} is VALID [2022-04-27 15:34:58,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {7306#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); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:58,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {7311#(= 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; {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:58,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {7311#(= 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; {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:58,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {7311#(= 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)))); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:58,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {7311#(= 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); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:58,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {7311#(= 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; {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:58,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:58,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {7311#(= 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); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:58,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {7311#(= 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); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:58,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {7311#(= 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); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:58,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {7311#(= 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); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:58,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {7311#(= 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); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:58,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {7311#(= 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); {7312#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-27 15:34:58,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {7312#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {7307#false} is VALID [2022-04-27 15:34:58,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {7307#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; {7307#false} is VALID [2022-04-27 15:34:58,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {7307#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); {7307#false} is VALID [2022-04-27 15:34:58,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {7307#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); {7307#false} is VALID [2022-04-27 15:34:58,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {7307#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7307#false} is VALID [2022-04-27 15:34:58,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {7307#false} ~skip~0 := 0; {7307#false} is VALID [2022-04-27 15:34:58,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {7307#false} assume !false; {7307#false} is VALID [2022-04-27 15:34:58,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {7307#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); {7307#false} is VALID [2022-04-27 15:34:58,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {7307#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {7307#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {7307#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {7307#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {7307#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {7307#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {7307#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {7307#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {7307#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,966 INFO L290 TraceCheckUtils]: 38: Hoare triple {7307#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {7307#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {7307#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {7307#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {7307#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {7307#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {7307#false} assume 8528 == #t~mem62;havoc #t~mem62; {7307#false} is VALID [2022-04-27 15:34:58,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {7307#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); {7307#false} is VALID [2022-04-27 15:34:58,966 INFO L290 TraceCheckUtils]: 46: Hoare triple {7307#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; {7307#false} is VALID [2022-04-27 15:34:58,966 INFO L290 TraceCheckUtils]: 47: Hoare triple {7307#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); {7307#false} is VALID [2022-04-27 15:34:58,966 INFO L290 TraceCheckUtils]: 48: Hoare triple {7307#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {7307#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 50: Hoare triple {7307#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 51: Hoare triple {7307#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 52: Hoare triple {7307#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); {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {7307#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 54: Hoare triple {7307#false} ~skip~0 := 0; {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 55: Hoare triple {7307#false} assume !false; {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 56: Hoare triple {7307#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); {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 57: Hoare triple {7307#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 58: Hoare triple {7307#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 59: Hoare triple {7307#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {7307#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 61: Hoare triple {7307#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 62: Hoare triple {7307#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,967 INFO L290 TraceCheckUtils]: 63: Hoare triple {7307#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 64: Hoare triple {7307#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 65: Hoare triple {7307#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 66: Hoare triple {7307#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 67: Hoare triple {7307#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 68: Hoare triple {7307#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 69: Hoare triple {7307#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 70: Hoare triple {7307#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 71: Hoare triple {7307#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {7307#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {7307#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 74: Hoare triple {7307#false} assume 8544 == #t~mem64;havoc #t~mem64; {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 75: Hoare triple {7307#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 76: Hoare triple {7307#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); {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 77: Hoare triple {7307#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {7307#false} is VALID [2022-04-27 15:34:58,968 INFO L290 TraceCheckUtils]: 78: Hoare triple {7307#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); {7307#false} is VALID [2022-04-27 15:34:58,969 INFO L290 TraceCheckUtils]: 79: Hoare triple {7307#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; {7307#false} is VALID [2022-04-27 15:34:58,969 INFO L290 TraceCheckUtils]: 80: Hoare triple {7307#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; {7307#false} is VALID [2022-04-27 15:34:58,969 INFO L290 TraceCheckUtils]: 81: Hoare triple {7307#false} assume 7 == ~blastFlag~0; {7307#false} is VALID [2022-04-27 15:34:58,969 INFO L290 TraceCheckUtils]: 82: Hoare triple {7307#false} assume !false; {7307#false} is VALID [2022-04-27 15:34:58,970 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:34:58,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:34:58,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512200495] [2022-04-27 15:34:58,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512200495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:34:58,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:34:58,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:34:58,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617241290] [2022-04-27 15:34:58,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:34:58,971 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 83 [2022-04-27 15:34:58,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:34:58,972 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:34:59,023 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:34:59,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:34:59,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:34:59,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:34:59,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:34:59,025 INFO L87 Difference]: Start difference. First operand 261 states and 428 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:35:03,287 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:35:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:06,305 INFO L93 Difference]: Finished difference Result 513 states and 839 transitions. [2022-04-27 15:35:06,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:35:06,306 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 83 [2022-04-27 15:35:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:35:06,306 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:35:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-27 15:35:06,309 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:35:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-27 15:35:06,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-27 15:35:06,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:35:06,605 INFO L225 Difference]: With dead ends: 513 [2022-04-27 15:35:06,605 INFO L226 Difference]: Without dead ends: 278 [2022-04-27 15:35:06,606 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:35:06,606 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:35:06,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 483 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-27 15:35:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-27 15:35:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 261. [2022-04-27 15:35:06,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:35:06,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 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:35:06,612 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 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:35:06,612 INFO L87 Difference]: Start difference. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 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:35:06,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:06,616 INFO L93 Difference]: Finished difference Result 278 states and 448 transitions. [2022-04-27 15:35:06,617 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 448 transitions. [2022-04-27 15:35:06,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:06,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:06,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 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 278 states. [2022-04-27 15:35:06,618 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 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 278 states. [2022-04-27 15:35:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:06,622 INFO L93 Difference]: Finished difference Result 278 states and 448 transitions. [2022-04-27 15:35:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 448 transitions. [2022-04-27 15:35:06,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:06,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:06,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:35:06,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:35:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 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:35:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 427 transitions. [2022-04-27 15:35:06,627 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 427 transitions. Word has length 83 [2022-04-27 15:35:06,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:35:06,628 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 427 transitions. [2022-04-27 15:35:06,628 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:35:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 427 transitions. [2022-04-27 15:35:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:35:06,628 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:35:06,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1] [2022-04-27 15:35:06,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:35:06,629 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:35:06,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:35:06,629 INFO L85 PathProgramCache]: Analyzing trace with hash -522284645, now seen corresponding path program 1 times [2022-04-27 15:35:06,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:35:06,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432576141] [2022-04-27 15:35:06,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:35:06,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:35:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:06,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:35:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:06,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {8761#(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); {8754#true} is VALID [2022-04-27 15:35:06,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {8754#true} assume true; {8754#true} is VALID [2022-04-27 15:35:06,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8754#true} {8754#true} #690#return; {8754#true} is VALID [2022-04-27 15:35:06,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {8754#true} call ULTIMATE.init(); {8761#(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:35:06,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {8761#(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); {8754#true} is VALID [2022-04-27 15:35:06,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {8754#true} assume true; {8754#true} is VALID [2022-04-27 15:35:06,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8754#true} {8754#true} #690#return; {8754#true} is VALID [2022-04-27 15:35:06,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {8754#true} call #t~ret161 := main(); {8754#true} is VALID [2022-04-27 15:35:06,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {8754#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; {8754#true} is VALID [2022-04-27 15:35:06,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {8754#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8754#true} is VALID [2022-04-27 15:35:06,755 INFO L272 TraceCheckUtils]: 7: Hoare triple {8754#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8754#true} is VALID [2022-04-27 15:35:06,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {8754#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); {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:06,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {8759#(not (= 12292 (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; {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:06,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {8759#(not (= 12292 (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; {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:06,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {8759#(not (= 12292 (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)))); {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:06,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {8759#(not (= 12292 (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); {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:06,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {8759#(not (= 12292 (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; {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:06,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:06,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {8759#(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); {8760#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-27 15:35:06,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {8760#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {8755#false} is VALID [2022-04-27 15:35:06,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {8755#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {8755#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {8755#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {8755#false} is VALID [2022-04-27 15:35:06,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {8755#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {8755#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); {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {8755#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {8755#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); {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {8755#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); {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {8755#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); {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {8755#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {8755#false} ~skip~0 := 0; {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {8755#false} assume !false; {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {8755#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); {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {8755#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {8755#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 32: Hoare triple {8755#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {8755#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {8755#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {8755#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {8755#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {8755#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {8755#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {8755#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {8755#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {8755#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {8755#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,765 INFO L290 TraceCheckUtils]: 43: Hoare triple {8755#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {8755#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,765 INFO L290 TraceCheckUtils]: 45: Hoare triple {8755#false} assume 8528 == #t~mem62;havoc #t~mem62; {8755#false} is VALID [2022-04-27 15:35:06,765 INFO L290 TraceCheckUtils]: 46: Hoare triple {8755#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); {8755#false} is VALID [2022-04-27 15:35:06,765 INFO L290 TraceCheckUtils]: 47: Hoare triple {8755#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; {8755#false} is VALID [2022-04-27 15:35:06,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {8755#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); {8755#false} is VALID [2022-04-27 15:35:06,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {8755#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {8755#false} is VALID [2022-04-27 15:35:06,766 INFO L290 TraceCheckUtils]: 50: Hoare triple {8755#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {8755#false} is VALID [2022-04-27 15:35:06,766 INFO L290 TraceCheckUtils]: 51: Hoare triple {8755#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {8755#false} is VALID [2022-04-27 15:35:06,766 INFO L290 TraceCheckUtils]: 52: Hoare triple {8755#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {8755#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); {8755#false} is VALID [2022-04-27 15:35:06,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {8755#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8755#false} is VALID [2022-04-27 15:35:06,766 INFO L290 TraceCheckUtils]: 55: Hoare triple {8755#false} ~skip~0 := 0; {8755#false} is VALID [2022-04-27 15:35:06,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {8755#false} assume !false; {8755#false} is VALID [2022-04-27 15:35:06,767 INFO L290 TraceCheckUtils]: 57: Hoare triple {8755#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); {8755#false} is VALID [2022-04-27 15:35:06,767 INFO L290 TraceCheckUtils]: 58: Hoare triple {8755#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,767 INFO L290 TraceCheckUtils]: 59: Hoare triple {8755#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,767 INFO L290 TraceCheckUtils]: 60: Hoare triple {8755#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,767 INFO L290 TraceCheckUtils]: 61: Hoare triple {8755#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,767 INFO L290 TraceCheckUtils]: 62: Hoare triple {8755#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,767 INFO L290 TraceCheckUtils]: 63: Hoare triple {8755#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,767 INFO L290 TraceCheckUtils]: 64: Hoare triple {8755#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,767 INFO L290 TraceCheckUtils]: 65: Hoare triple {8755#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,767 INFO L290 TraceCheckUtils]: 66: Hoare triple {8755#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,767 INFO L290 TraceCheckUtils]: 67: Hoare triple {8755#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,767 INFO L290 TraceCheckUtils]: 68: Hoare triple {8755#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,767 INFO L290 TraceCheckUtils]: 69: Hoare triple {8755#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,767 INFO L290 TraceCheckUtils]: 70: Hoare triple {8755#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,768 INFO L290 TraceCheckUtils]: 71: Hoare triple {8755#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,768 INFO L290 TraceCheckUtils]: 72: Hoare triple {8755#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,768 INFO L290 TraceCheckUtils]: 73: Hoare triple {8755#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,768 INFO L290 TraceCheckUtils]: 74: Hoare triple {8755#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,768 INFO L290 TraceCheckUtils]: 75: Hoare triple {8755#false} assume 8544 == #t~mem64;havoc #t~mem64; {8755#false} is VALID [2022-04-27 15:35:06,768 INFO L290 TraceCheckUtils]: 76: Hoare triple {8755#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:35:06,768 INFO L290 TraceCheckUtils]: 77: Hoare triple {8755#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); {8755#false} is VALID [2022-04-27 15:35:06,768 INFO L290 TraceCheckUtils]: 78: Hoare triple {8755#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {8755#false} is VALID [2022-04-27 15:35:06,768 INFO L290 TraceCheckUtils]: 79: Hoare triple {8755#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); {8755#false} is VALID [2022-04-27 15:35:06,768 INFO L290 TraceCheckUtils]: 80: Hoare triple {8755#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; {8755#false} is VALID [2022-04-27 15:35:06,768 INFO L290 TraceCheckUtils]: 81: Hoare triple {8755#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; {8755#false} is VALID [2022-04-27 15:35:06,768 INFO L290 TraceCheckUtils]: 82: Hoare triple {8755#false} assume 7 == ~blastFlag~0; {8755#false} is VALID [2022-04-27 15:35:06,768 INFO L290 TraceCheckUtils]: 83: Hoare triple {8755#false} assume !false; {8755#false} is VALID [2022-04-27 15:35:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:35:06,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:35:06,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432576141] [2022-04-27 15:35:06,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432576141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:35:06,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:35:06,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:35:06,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353793530] [2022-04-27 15:35:06,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:35:06,771 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 84 [2022-04-27 15:35:06,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:35:06,771 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:35:06,817 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:35:06,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:35:06,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:35:06,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:35:06,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:35:06,819 INFO L87 Difference]: Start difference. First operand 261 states and 427 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:35:08,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:35:09,981 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:35:14,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:35:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:15,247 INFO L93 Difference]: Finished difference Result 574 states and 927 transitions. [2022-04-27 15:35:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:35:15,248 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 84 [2022-04-27 15:35:15,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:35:15,248 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:35:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-27 15:35:15,252 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:35:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-27 15:35:15,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 594 transitions. [2022-04-27 15:35:15,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:35:15,667 INFO L225 Difference]: With dead ends: 574 [2022-04-27 15:35:15,667 INFO L226 Difference]: Without dead ends: 339 [2022-04-27 15:35:15,668 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:35:15,668 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 150 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:35:15,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 366 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-27 15:35:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-27 15:35:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 261. [2022-04-27 15:35:15,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:35:15,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 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:35:15,675 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 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:35:15,676 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 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:35:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:15,682 INFO L93 Difference]: Finished difference Result 339 states and 533 transitions. [2022-04-27 15:35:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 533 transitions. [2022-04-27 15:35:15,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:15,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:15,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 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 339 states. [2022-04-27 15:35:15,683 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 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 339 states. [2022-04-27 15:35:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:15,689 INFO L93 Difference]: Finished difference Result 339 states and 533 transitions. [2022-04-27 15:35:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 533 transitions. [2022-04-27 15:35:15,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:15,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:15,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:35:15,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:35:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 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:35:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 423 transitions. [2022-04-27 15:35:15,694 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 423 transitions. Word has length 84 [2022-04-27 15:35:15,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:35:15,694 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 423 transitions. [2022-04-27 15:35:15,694 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:35:15,694 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 423 transitions. [2022-04-27 15:35:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:35:15,696 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:35:15,696 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-04-27 15:35:15,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:35:15,696 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:35:15,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:35:15,696 INFO L85 PathProgramCache]: Analyzing trace with hash 725507119, now seen corresponding path program 1 times [2022-04-27 15:35:15,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:35:15,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231711122] [2022-04-27 15:35:15,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:35:15,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:35:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:15,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:35:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:15,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {10407#(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); {10400#true} is VALID [2022-04-27 15:35:15,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {10400#true} assume true; {10400#true} is VALID [2022-04-27 15:35:15,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10400#true} {10400#true} #690#return; {10400#true} is VALID [2022-04-27 15:35:15,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {10400#true} call ULTIMATE.init(); {10407#(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:35:15,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {10407#(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); {10400#true} is VALID [2022-04-27 15:35:15,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {10400#true} assume true; {10400#true} is VALID [2022-04-27 15:35:15,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10400#true} {10400#true} #690#return; {10400#true} is VALID [2022-04-27 15:35:15,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {10400#true} call #t~ret161 := main(); {10400#true} is VALID [2022-04-27 15:35:15,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {10400#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; {10400#true} is VALID [2022-04-27 15:35:15,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {10400#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {10400#true} is VALID [2022-04-27 15:35:15,832 INFO L272 TraceCheckUtils]: 7: Hoare triple {10400#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10400#true} is VALID [2022-04-27 15:35:15,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {10400#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); {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:15,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {10405#(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; {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:15,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {10405#(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; {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:15,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {10405#(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)))); {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:15,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {10405#(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); {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:15,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {10405#(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; {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:15,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:15,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {10405#(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); {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:15,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {10405#(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); {10406#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-27 15:35:15,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {10406#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {10401#false} is VALID [2022-04-27 15:35:15,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {10401#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {10401#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {10401#false} is VALID [2022-04-27 15:35:15,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {10401#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {10401#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); {10401#false} is VALID [2022-04-27 15:35:15,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {10401#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {10401#false} is VALID [2022-04-27 15:35:15,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {10401#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); {10401#false} is VALID [2022-04-27 15:35:15,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {10401#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); {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {10401#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); {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {10401#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {10401#false} ~skip~0 := 0; {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {10401#false} assume !false; {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {10401#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); {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {10401#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {10401#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {10401#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {10401#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {10401#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {10401#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {10401#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {10401#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {10401#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {10401#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {10401#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {10401#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {10401#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 43: Hoare triple {10401#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 44: Hoare triple {10401#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 45: Hoare triple {10401#false} assume 8528 == #t~mem62;havoc #t~mem62; {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 46: Hoare triple {10401#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); {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 47: Hoare triple {10401#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; {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 48: Hoare triple {10401#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); {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 49: Hoare triple {10401#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 50: Hoare triple {10401#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 51: Hoare triple {10401#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 52: Hoare triple {10401#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 53: Hoare triple {10401#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); {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 54: Hoare triple {10401#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {10401#false} ~skip~0 := 0; {10401#false} is VALID [2022-04-27 15:35:15,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {10401#false} assume !false; {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {10401#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); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {10401#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 59: Hoare triple {10401#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 60: Hoare triple {10401#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 61: Hoare triple {10401#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 62: Hoare triple {10401#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 63: Hoare triple {10401#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 64: Hoare triple {10401#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 65: Hoare triple {10401#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 66: Hoare triple {10401#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 67: Hoare triple {10401#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 68: Hoare triple {10401#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 69: Hoare triple {10401#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 70: Hoare triple {10401#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 71: Hoare triple {10401#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 72: Hoare triple {10401#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,840 INFO L290 TraceCheckUtils]: 73: Hoare triple {10401#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,841 INFO L290 TraceCheckUtils]: 74: Hoare triple {10401#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,841 INFO L290 TraceCheckUtils]: 75: Hoare triple {10401#false} assume 8544 == #t~mem64;havoc #t~mem64; {10401#false} is VALID [2022-04-27 15:35:15,841 INFO L290 TraceCheckUtils]: 76: Hoare triple {10401#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:35:15,841 INFO L290 TraceCheckUtils]: 77: Hoare triple {10401#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); {10401#false} is VALID [2022-04-27 15:35:15,841 INFO L290 TraceCheckUtils]: 78: Hoare triple {10401#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {10401#false} is VALID [2022-04-27 15:35:15,841 INFO L290 TraceCheckUtils]: 79: Hoare triple {10401#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); {10401#false} is VALID [2022-04-27 15:35:15,841 INFO L290 TraceCheckUtils]: 80: Hoare triple {10401#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; {10401#false} is VALID [2022-04-27 15:35:15,841 INFO L290 TraceCheckUtils]: 81: Hoare triple {10401#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; {10401#false} is VALID [2022-04-27 15:35:15,841 INFO L290 TraceCheckUtils]: 82: Hoare triple {10401#false} assume 7 == ~blastFlag~0; {10401#false} is VALID [2022-04-27 15:35:15,841 INFO L290 TraceCheckUtils]: 83: Hoare triple {10401#false} assume !false; {10401#false} is VALID [2022-04-27 15:35:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:35:15,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:35:15,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231711122] [2022-04-27 15:35:15,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231711122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:35:15,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:35:15,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:35:15,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739143613] [2022-04-27 15:35:15,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:35:15,843 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 84 [2022-04-27 15:35:15,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:35:15,843 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:35:15,889 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:35:15,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:35:15,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:35:15,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:35:15,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:35:15,890 INFO L87 Difference]: Start difference. First operand 261 states and 423 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:35:17,910 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:35:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:19,040 INFO L93 Difference]: Finished difference Result 574 states and 920 transitions. [2022-04-27 15:35:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:35:19,040 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 84 [2022-04-27 15:35:19,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:35:19,041 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:35:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-27 15:35:19,044 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:35:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-27 15:35:19,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-27 15:35:19,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:35:19,459 INFO L225 Difference]: With dead ends: 574 [2022-04-27 15:35:19,460 INFO L226 Difference]: Without dead ends: 339 [2022-04-27 15:35:19,460 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:35:19,460 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 148 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:35:19,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 366 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:35:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-27 15:35:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 261. [2022-04-27 15:35:19,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:35:19,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 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:35:19,471 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 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:35:19,472 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 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:35:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:19,478 INFO L93 Difference]: Finished difference Result 339 states and 529 transitions. [2022-04-27 15:35:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 529 transitions. [2022-04-27 15:35:19,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:19,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:19,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 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 339 states. [2022-04-27 15:35:19,480 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 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 339 states. [2022-04-27 15:35:19,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:19,485 INFO L93 Difference]: Finished difference Result 339 states and 529 transitions. [2022-04-27 15:35:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 529 transitions. [2022-04-27 15:35:19,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:19,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:19,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:35:19,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:35:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 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:35:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 419 transitions. [2022-04-27 15:35:19,490 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 419 transitions. Word has length 84 [2022-04-27 15:35:19,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:35:19,490 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 419 transitions. [2022-04-27 15:35:19,490 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:35:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 419 transitions. [2022-04-27 15:35:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:35:19,491 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:35:19,491 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:35:19,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:35:19,491 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:35:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:35:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1148494374, now seen corresponding path program 1 times [2022-04-27 15:35:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:35:19,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980591810] [2022-04-27 15:35:19,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:35:19,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:35:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:19,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:35:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:19,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {12053#(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); {12046#true} is VALID [2022-04-27 15:35:19,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {12046#true} assume true; {12046#true} is VALID [2022-04-27 15:35:19,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12046#true} {12046#true} #690#return; {12046#true} is VALID [2022-04-27 15:35:19,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {12046#true} call ULTIMATE.init(); {12053#(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:35:19,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {12053#(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); {12046#true} is VALID [2022-04-27 15:35:19,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {12046#true} assume true; {12046#true} is VALID [2022-04-27 15:35:19,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12046#true} {12046#true} #690#return; {12046#true} is VALID [2022-04-27 15:35:19,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {12046#true} call #t~ret161 := main(); {12046#true} is VALID [2022-04-27 15:35:19,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {12046#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; {12046#true} is VALID [2022-04-27 15:35:19,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {12046#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12046#true} is VALID [2022-04-27 15:35:19,592 INFO L272 TraceCheckUtils]: 7: Hoare triple {12046#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12046#true} is VALID [2022-04-27 15:35:19,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {12046#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); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:19,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {12051#(= 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; {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:19,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {12051#(= 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; {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:19,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {12051#(= 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)))); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:19,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {12051#(= 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); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:19,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {12051#(= 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; {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:19,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:19,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {12051#(= 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); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:19,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {12051#(= 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); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:19,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {12051#(= 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); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:19,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {12051#(= 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); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:19,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {12051#(= 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); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:19,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {12051#(= 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); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:19,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {12051#(= 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); {12052#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-27 15:35:19,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {12052#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {12047#false} is VALID [2022-04-27 15:35:19,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {12047#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; {12047#false} is VALID [2022-04-27 15:35:19,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {12047#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); {12047#false} is VALID [2022-04-27 15:35:19,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {12047#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); {12047#false} is VALID [2022-04-27 15:35:19,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {12047#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12047#false} is VALID [2022-04-27 15:35:19,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {12047#false} ~skip~0 := 0; {12047#false} is VALID [2022-04-27 15:35:19,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {12047#false} assume !false; {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {12047#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); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {12047#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {12047#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {12047#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {12047#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {12047#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {12047#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {12047#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {12047#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {12047#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {12047#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {12047#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {12047#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {12047#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {12047#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,599 INFO L290 TraceCheckUtils]: 44: Hoare triple {12047#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {12047#false} assume 8528 == #t~mem62;havoc #t~mem62; {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 46: Hoare triple {12047#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); {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {12047#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; {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 48: Hoare triple {12047#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); {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 49: Hoare triple {12047#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 50: Hoare triple {12047#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 51: Hoare triple {12047#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 52: Hoare triple {12047#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 53: Hoare triple {12047#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); {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 54: Hoare triple {12047#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 55: Hoare triple {12047#false} ~skip~0 := 0; {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 56: Hoare triple {12047#false} assume !false; {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 57: Hoare triple {12047#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); {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 58: Hoare triple {12047#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 59: Hoare triple {12047#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {12047#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {12047#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {12047#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {12047#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {12047#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 65: Hoare triple {12047#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 66: Hoare triple {12047#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 67: Hoare triple {12047#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 68: Hoare triple {12047#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 69: Hoare triple {12047#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 70: Hoare triple {12047#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 71: Hoare triple {12047#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 72: Hoare triple {12047#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 73: Hoare triple {12047#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 74: Hoare triple {12047#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 75: Hoare triple {12047#false} assume 8544 == #t~mem64;havoc #t~mem64; {12047#false} is VALID [2022-04-27 15:35:19,601 INFO L290 TraceCheckUtils]: 76: Hoare triple {12047#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:35:19,602 INFO L290 TraceCheckUtils]: 77: Hoare triple {12047#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); {12047#false} is VALID [2022-04-27 15:35:19,602 INFO L290 TraceCheckUtils]: 78: Hoare triple {12047#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {12047#false} is VALID [2022-04-27 15:35:19,602 INFO L290 TraceCheckUtils]: 79: Hoare triple {12047#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); {12047#false} is VALID [2022-04-27 15:35:19,602 INFO L290 TraceCheckUtils]: 80: Hoare triple {12047#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; {12047#false} is VALID [2022-04-27 15:35:19,602 INFO L290 TraceCheckUtils]: 81: Hoare triple {12047#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; {12047#false} is VALID [2022-04-27 15:35:19,602 INFO L290 TraceCheckUtils]: 82: Hoare triple {12047#false} assume 7 == ~blastFlag~0; {12047#false} is VALID [2022-04-27 15:35:19,602 INFO L290 TraceCheckUtils]: 83: Hoare triple {12047#false} assume !false; {12047#false} is VALID [2022-04-27 15:35:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:35:19,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:35:19,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980591810] [2022-04-27 15:35:19,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980591810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:35:19,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:35:19,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:35:19,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317321516] [2022-04-27 15:35:19,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:35:19,603 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 84 [2022-04-27 15:35:19,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:35:19,604 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:35:19,650 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:35:19,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:35:19,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:35:19,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:35:19,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:35:19,651 INFO L87 Difference]: Start difference. First operand 261 states and 419 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:35:24,585 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:35:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:26,157 INFO L93 Difference]: Finished difference Result 510 states and 821 transitions. [2022-04-27 15:35:26,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:35:26,157 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 84 [2022-04-27 15:35:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:35:26,157 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:35:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-27 15:35:26,160 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:35:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-27 15:35:26,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-27 15:35:26,465 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:35:26,468 INFO L225 Difference]: With dead ends: 510 [2022-04-27 15:35:26,469 INFO L226 Difference]: Without dead ends: 275 [2022-04-27 15:35:26,469 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:35:26,469 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:35:26,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 357 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-04-27 15:35:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-27 15:35:26,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2022-04-27 15:35:26,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:35:26,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 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:35:26,474 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 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:35:26,474 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 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:35:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:26,478 INFO L93 Difference]: Finished difference Result 275 states and 436 transitions. [2022-04-27 15:35:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 436 transitions. [2022-04-27 15:35:26,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:26,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:26,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 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 275 states. [2022-04-27 15:35:26,479 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 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 275 states. [2022-04-27 15:35:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:26,483 INFO L93 Difference]: Finished difference Result 275 states and 436 transitions. [2022-04-27 15:35:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 436 transitions. [2022-04-27 15:35:26,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:26,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:26,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:35:26,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:35:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 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:35:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 418 transitions. [2022-04-27 15:35:26,487 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 418 transitions. Word has length 84 [2022-04-27 15:35:26,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:35:26,487 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 418 transitions. [2022-04-27 15:35:26,488 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:35:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 418 transitions. [2022-04-27 15:35:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:35:26,488 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:35:26,488 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-04-27 15:35:26,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:35:26,489 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:35:26,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:35:26,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1158470119, now seen corresponding path program 1 times [2022-04-27 15:35:26,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:35:26,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121359519] [2022-04-27 15:35:26,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:35:26,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:35:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:26,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:35:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:26,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {13490#(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); {13483#true} is VALID [2022-04-27 15:35:26,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {13483#true} assume true; {13483#true} is VALID [2022-04-27 15:35:26,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13483#true} {13483#true} #690#return; {13483#true} is VALID [2022-04-27 15:35:26,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {13483#true} call ULTIMATE.init(); {13490#(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:35:26,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {13490#(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); {13483#true} is VALID [2022-04-27 15:35:26,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {13483#true} assume true; {13483#true} is VALID [2022-04-27 15:35:26,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13483#true} {13483#true} #690#return; {13483#true} is VALID [2022-04-27 15:35:26,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {13483#true} call #t~ret161 := main(); {13483#true} is VALID [2022-04-27 15:35:26,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {13483#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; {13483#true} is VALID [2022-04-27 15:35:26,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {13483#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {13483#true} is VALID [2022-04-27 15:35:26,589 INFO L272 TraceCheckUtils]: 7: Hoare triple {13483#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13483#true} is VALID [2022-04-27 15:35:26,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {13483#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); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:26,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {13488#(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; {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:26,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {13488#(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; {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:26,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {13488#(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)))); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:26,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {13488#(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); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:26,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {13488#(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; {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:26,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:26,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {13488#(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); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:26,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {13488#(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); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:26,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {13488#(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); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:26,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {13488#(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); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:26,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {13488#(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); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:26,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {13488#(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); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:26,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {13488#(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); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:26,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {13488#(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); {13489#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-27 15:35:26,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {13489#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {13484#false} is VALID [2022-04-27 15:35:26,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {13484#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {13484#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); {13484#false} is VALID [2022-04-27 15:35:26,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {13484#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13484#false} is VALID [2022-04-27 15:35:26,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {13484#false} ~skip~0 := 0; {13484#false} is VALID [2022-04-27 15:35:26,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {13484#false} assume !false; {13484#false} is VALID [2022-04-27 15:35:26,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {13484#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); {13484#false} is VALID [2022-04-27 15:35:26,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {13484#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {13484#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {13484#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {13484#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {13484#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {13484#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 36: Hoare triple {13484#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {13484#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {13484#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {13484#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {13484#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {13484#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {13484#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {13484#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {13484#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {13484#false} assume 8528 == #t~mem62;havoc #t~mem62; {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {13484#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); {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {13484#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; {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {13484#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); {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 49: Hoare triple {13484#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 50: Hoare triple {13484#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {13484#false} is VALID [2022-04-27 15:35:26,597 INFO L290 TraceCheckUtils]: 51: Hoare triple {13484#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {13484#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {13484#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); {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 54: Hoare triple {13484#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 55: Hoare triple {13484#false} ~skip~0 := 0; {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {13484#false} assume !false; {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {13484#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); {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 58: Hoare triple {13484#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 59: Hoare triple {13484#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 60: Hoare triple {13484#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 61: Hoare triple {13484#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 62: Hoare triple {13484#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 63: Hoare triple {13484#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 64: Hoare triple {13484#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 65: Hoare triple {13484#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 66: Hoare triple {13484#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 67: Hoare triple {13484#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {13484#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 69: Hoare triple {13484#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 70: Hoare triple {13484#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 71: Hoare triple {13484#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 72: Hoare triple {13484#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 73: Hoare triple {13484#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 74: Hoare triple {13484#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 75: Hoare triple {13484#false} assume 8544 == #t~mem64;havoc #t~mem64; {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 76: Hoare triple {13484#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 77: Hoare triple {13484#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); {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 78: Hoare triple {13484#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 79: Hoare triple {13484#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); {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 80: Hoare triple {13484#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; {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 81: Hoare triple {13484#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; {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 82: Hoare triple {13484#false} assume 7 == ~blastFlag~0; {13484#false} is VALID [2022-04-27 15:35:26,599 INFO L290 TraceCheckUtils]: 83: Hoare triple {13484#false} assume !false; {13484#false} is VALID [2022-04-27 15:35:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:35:26,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:35:26,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121359519] [2022-04-27 15:35:26,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121359519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:35:26,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:35:26,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:35:26,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840200677] [2022-04-27 15:35:26,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:35:26,601 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 84 [2022-04-27 15:35:26,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:35:26,601 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:35:26,643 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:35:26,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:35:26,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:35:26,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:35:26,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:35:26,645 INFO L87 Difference]: Start difference. First operand 261 states and 418 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:35:29,999 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:35:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:31,981 INFO L93 Difference]: Finished difference Result 573 states and 911 transitions. [2022-04-27 15:35:31,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:35:31,982 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 84 [2022-04-27 15:35:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:35:31,982 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:35:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-27 15:35:31,984 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:35:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-27 15:35:31,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-27 15:35:32,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:35:32,357 INFO L225 Difference]: With dead ends: 573 [2022-04-27 15:35:32,358 INFO L226 Difference]: Without dead ends: 338 [2022-04-27 15:35:32,358 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:35:32,358 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 141 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:35:32,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 368 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-27 15:35:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-27 15:35:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 261. [2022-04-27 15:35:32,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:35:32,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 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:35:32,363 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 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:35:32,364 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 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:35:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:32,368 INFO L93 Difference]: Finished difference Result 338 states and 523 transitions. [2022-04-27 15:35:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 523 transitions. [2022-04-27 15:35:32,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:32,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:32,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 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 338 states. [2022-04-27 15:35:32,369 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 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 338 states. [2022-04-27 15:35:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:32,374 INFO L93 Difference]: Finished difference Result 338 states and 523 transitions. [2022-04-27 15:35:32,374 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 523 transitions. [2022-04-27 15:35:32,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:32,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:32,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:35:32,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:35:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 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:35:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 414 transitions. [2022-04-27 15:35:32,379 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 414 transitions. Word has length 84 [2022-04-27 15:35:32,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:35:32,379 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 414 transitions. [2022-04-27 15:35:32,379 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:35:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 414 transitions. [2022-04-27 15:35:32,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 15:35:32,380 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:35:32,380 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:35:32,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:35:32,380 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:35:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:35:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1113618796, now seen corresponding path program 1 times [2022-04-27 15:35:32,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:35:32,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185729665] [2022-04-27 15:35:32,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:35:32,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:35:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:32,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:35:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:32,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {15132#(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); {15125#true} is VALID [2022-04-27 15:35:32,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {15125#true} assume true; {15125#true} is VALID [2022-04-27 15:35:32,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15125#true} {15125#true} #690#return; {15125#true} is VALID [2022-04-27 15:35:32,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {15125#true} call ULTIMATE.init(); {15132#(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:35:32,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {15132#(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); {15125#true} is VALID [2022-04-27 15:35:32,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {15125#true} assume true; {15125#true} is VALID [2022-04-27 15:35:32,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15125#true} {15125#true} #690#return; {15125#true} is VALID [2022-04-27 15:35:32,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {15125#true} call #t~ret161 := main(); {15125#true} is VALID [2022-04-27 15:35:32,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {15125#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; {15125#true} is VALID [2022-04-27 15:35:32,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {15125#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {15125#true} is VALID [2022-04-27 15:35:32,490 INFO L272 TraceCheckUtils]: 7: Hoare triple {15125#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {15125#true} is VALID [2022-04-27 15:35:32,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {15125#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); {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:32,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {15130#(= 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; {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:32,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {15130#(= 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; {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:32,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {15130#(= 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)))); {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:32,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {15130#(= 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); {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:32,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {15130#(= 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; {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:32,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:32,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {15130#(= 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); {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:32,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {15130#(= 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); {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:32,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {15130#(= 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); {15131#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {15131#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {15126#false} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {15126#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {15126#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15126#false} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {15126#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {15126#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); {15126#false} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {15126#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {15126#false} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {15126#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); {15126#false} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {15126#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); {15126#false} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {15126#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); {15126#false} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {15126#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {15126#false} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {15126#false} ~skip~0 := 0; {15126#false} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {15126#false} assume !false; {15126#false} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {15126#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); {15126#false} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {15126#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {15126#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {15126#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {15126#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {15126#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {15126#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {15126#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {15126#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 39: Hoare triple {15126#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 40: Hoare triple {15126#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {15126#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {15126#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 43: Hoare triple {15126#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 44: Hoare triple {15126#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 45: Hoare triple {15126#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 46: Hoare triple {15126#false} assume 8528 == #t~mem62;havoc #t~mem62; {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 47: Hoare triple {15126#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); {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 48: Hoare triple {15126#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; {15126#false} is VALID [2022-04-27 15:35:32,497 INFO L290 TraceCheckUtils]: 49: Hoare triple {15126#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); {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 50: Hoare triple {15126#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 51: Hoare triple {15126#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 52: Hoare triple {15126#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 53: Hoare triple {15126#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 54: Hoare triple {15126#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); {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 55: Hoare triple {15126#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 56: Hoare triple {15126#false} ~skip~0 := 0; {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 57: Hoare triple {15126#false} assume !false; {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {15126#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); {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {15126#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {15126#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {15126#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {15126#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 63: Hoare triple {15126#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 64: Hoare triple {15126#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,498 INFO L290 TraceCheckUtils]: 65: Hoare triple {15126#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {15126#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 67: Hoare triple {15126#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 68: Hoare triple {15126#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 69: Hoare triple {15126#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 70: Hoare triple {15126#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 71: Hoare triple {15126#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 72: Hoare triple {15126#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 73: Hoare triple {15126#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 74: Hoare triple {15126#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 75: Hoare triple {15126#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 76: Hoare triple {15126#false} assume 8544 == #t~mem64;havoc #t~mem64; {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 77: Hoare triple {15126#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 78: Hoare triple {15126#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); {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 79: Hoare triple {15126#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 80: Hoare triple {15126#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); {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 81: Hoare triple {15126#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; {15126#false} is VALID [2022-04-27 15:35:32,499 INFO L290 TraceCheckUtils]: 82: Hoare triple {15126#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; {15126#false} is VALID [2022-04-27 15:35:32,500 INFO L290 TraceCheckUtils]: 83: Hoare triple {15126#false} assume 7 == ~blastFlag~0; {15126#false} is VALID [2022-04-27 15:35:32,500 INFO L290 TraceCheckUtils]: 84: Hoare triple {15126#false} assume !false; {15126#false} is VALID [2022-04-27 15:35:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:35:32,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:35:32,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185729665] [2022-04-27 15:35:32,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185729665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:35:32,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:35:32,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:35:32,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441060073] [2022-04-27 15:35:32,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:35:32,501 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 85 [2022-04-27 15:35:32,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:35:32,501 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:35:32,542 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:35:32,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:35:32,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:35:32,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:35:32,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:35:32,543 INFO L87 Difference]: Start difference. First operand 261 states and 414 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:35:35,069 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:35:36,571 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:35:38,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:38,672 INFO L93 Difference]: Finished difference Result 509 states and 812 transitions. [2022-04-27 15:35:38,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:35:38,672 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 85 [2022-04-27 15:35:38,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:35:38,672 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:35:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-27 15:35:38,674 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:35:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-27 15:35:38,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-27 15:35:38,936 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:35:38,940 INFO L225 Difference]: With dead ends: 509 [2022-04-27 15:35:38,940 INFO L226 Difference]: Without dead ends: 274 [2022-04-27 15:35:38,940 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:35:38,941 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 22 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:35:38,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 491 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-27 15:35:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-04-27 15:35:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 261. [2022-04-27 15:35:38,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:35:38,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 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:35:38,945 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 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:35:38,945 INFO L87 Difference]: Start difference. First operand 274 states. Second operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 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:35:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:38,950 INFO L93 Difference]: Finished difference Result 274 states and 430 transitions. [2022-04-27 15:35:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 430 transitions. [2022-04-27 15:35:38,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:38,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:38,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 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 274 states. [2022-04-27 15:35:38,951 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 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 274 states. [2022-04-27 15:35:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:38,954 INFO L93 Difference]: Finished difference Result 274 states and 430 transitions. [2022-04-27 15:35:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 430 transitions. [2022-04-27 15:35:38,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:38,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:38,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:35:38,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:35:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 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:35:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 413 transitions. [2022-04-27 15:35:38,959 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 413 transitions. Word has length 85 [2022-04-27 15:35:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:35:38,959 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 413 transitions. [2022-04-27 15:35:38,959 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:35:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 413 transitions. [2022-04-27 15:35:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-27 15:35:38,960 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:35:38,960 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-04-27 15:35:38,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:35:38,960 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:35:38,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:35:38,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1037364332, now seen corresponding path program 1 times [2022-04-27 15:35:38,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:35:38,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779147055] [2022-04-27 15:35:38,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:35:38,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:35:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:39,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:35:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:39,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {16565#(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); {16558#true} is VALID [2022-04-27 15:35:39,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {16558#true} assume true; {16558#true} is VALID [2022-04-27 15:35:39,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16558#true} {16558#true} #690#return; {16558#true} is VALID [2022-04-27 15:35:39,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {16558#true} call ULTIMATE.init(); {16565#(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:35:39,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {16565#(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); {16558#true} is VALID [2022-04-27 15:35:39,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {16558#true} assume true; {16558#true} is VALID [2022-04-27 15:35:39,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16558#true} {16558#true} #690#return; {16558#true} is VALID [2022-04-27 15:35:39,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {16558#true} call #t~ret161 := main(); {16558#true} is VALID [2022-04-27 15:35:39,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {16558#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; {16558#true} is VALID [2022-04-27 15:35:39,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {16558#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16558#true} is VALID [2022-04-27 15:35:39,072 INFO L272 TraceCheckUtils]: 7: Hoare triple {16558#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16558#true} is VALID [2022-04-27 15:35:39,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {16558#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); {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:39,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {16563#(not (= 24576 (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; {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:39,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {16563#(not (= 24576 (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; {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:39,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {16563#(not (= 24576 (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)))); {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:39,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {16563#(not (= 24576 (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); {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:39,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {16563#(not (= 24576 (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; {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:39,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:39,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {16563#(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); {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:39,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {16563#(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); {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:39,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {16563#(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); {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:39,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {16563#(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); {16564#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-27 15:35:39,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {16564#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {16559#false} is VALID [2022-04-27 15:35:39,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {16559#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {16559#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16559#false} is VALID [2022-04-27 15:35:39,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {16559#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {16559#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); {16559#false} is VALID [2022-04-27 15:35:39,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {16559#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {16559#false} is VALID [2022-04-27 15:35:39,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {16559#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); {16559#false} is VALID [2022-04-27 15:35:39,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {16559#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); {16559#false} is VALID [2022-04-27 15:35:39,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {16559#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); {16559#false} is VALID [2022-04-27 15:35:39,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {16559#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16559#false} is VALID [2022-04-27 15:35:39,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {16559#false} ~skip~0 := 0; {16559#false} is VALID [2022-04-27 15:35:39,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {16559#false} assume !false; {16559#false} is VALID [2022-04-27 15:35:39,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {16559#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); {16559#false} is VALID [2022-04-27 15:35:39,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {16559#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {16559#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {16559#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 35: Hoare triple {16559#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {16559#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {16559#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {16559#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {16559#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {16559#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {16559#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {16559#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 43: Hoare triple {16559#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 44: Hoare triple {16559#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {16559#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 46: Hoare triple {16559#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 47: Hoare triple {16559#false} assume 8528 == #t~mem62;havoc #t~mem62; {16559#false} is VALID [2022-04-27 15:35:39,079 INFO L290 TraceCheckUtils]: 48: Hoare triple {16559#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); {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {16559#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; {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {16559#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); {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 51: Hoare triple {16559#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 52: Hoare triple {16559#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 53: Hoare triple {16559#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 54: Hoare triple {16559#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 55: Hoare triple {16559#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); {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 56: Hoare triple {16559#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 57: Hoare triple {16559#false} ~skip~0 := 0; {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 58: Hoare triple {16559#false} assume !false; {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 59: Hoare triple {16559#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); {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 60: Hoare triple {16559#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 61: Hoare triple {16559#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 62: Hoare triple {16559#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 63: Hoare triple {16559#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 64: Hoare triple {16559#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,080 INFO L290 TraceCheckUtils]: 65: Hoare triple {16559#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 66: Hoare triple {16559#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 67: Hoare triple {16559#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 68: Hoare triple {16559#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 69: Hoare triple {16559#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 70: Hoare triple {16559#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 71: Hoare triple {16559#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 72: Hoare triple {16559#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 73: Hoare triple {16559#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 74: Hoare triple {16559#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 75: Hoare triple {16559#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 76: Hoare triple {16559#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 77: Hoare triple {16559#false} assume 8544 == #t~mem64;havoc #t~mem64; {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 78: Hoare triple {16559#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 79: Hoare triple {16559#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); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 80: Hoare triple {16559#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 81: Hoare triple {16559#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); {16559#false} is VALID [2022-04-27 15:35:39,081 INFO L290 TraceCheckUtils]: 82: Hoare triple {16559#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; {16559#false} is VALID [2022-04-27 15:35:39,082 INFO L290 TraceCheckUtils]: 83: Hoare triple {16559#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; {16559#false} is VALID [2022-04-27 15:35:39,082 INFO L290 TraceCheckUtils]: 84: Hoare triple {16559#false} assume 7 == ~blastFlag~0; {16559#false} is VALID [2022-04-27 15:35:39,082 INFO L290 TraceCheckUtils]: 85: Hoare triple {16559#false} assume !false; {16559#false} is VALID [2022-04-27 15:35:39,082 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:35:39,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:35:39,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779147055] [2022-04-27 15:35:39,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779147055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:35:39,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:35:39,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:35:39,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645244580] [2022-04-27 15:35:39,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:35:39,083 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 86 [2022-04-27 15:35:39,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:35:39,083 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:35:39,124 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:35:39,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:35:39,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:35:39,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:35:39,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:35:39,125 INFO L87 Difference]: Start difference. First operand 261 states and 413 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:35:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:43,753 INFO L93 Difference]: Finished difference Result 573 states and 903 transitions. [2022-04-27 15:35:43,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:35:43,754 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 86 [2022-04-27 15:35:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:35:43,754 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:35:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-27 15:35:43,756 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:35:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-27 15:35:43,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-27 15:35:44,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:35:44,118 INFO L225 Difference]: With dead ends: 573 [2022-04-27 15:35:44,118 INFO L226 Difference]: Without dead ends: 338 [2022-04-27 15:35:44,119 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:35:44,119 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 144 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:35:44,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 368 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 15:35:44,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-27 15:35:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 261. [2022-04-27 15:35:44,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:35:44,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 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:35:44,124 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 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:35:44,124 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 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:35:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:44,129 INFO L93 Difference]: Finished difference Result 338 states and 518 transitions. [2022-04-27 15:35:44,129 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 518 transitions. [2022-04-27 15:35:44,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:44,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:44,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 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 338 states. [2022-04-27 15:35:44,130 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 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 338 states. [2022-04-27 15:35:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:44,135 INFO L93 Difference]: Finished difference Result 338 states and 518 transitions. [2022-04-27 15:35:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 518 transitions. [2022-04-27 15:35:44,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:44,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:44,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:35:44,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:35:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 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:35:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 409 transitions. [2022-04-27 15:35:44,139 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 409 transitions. Word has length 86 [2022-04-27 15:35:44,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:35:44,139 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 409 transitions. [2022-04-27 15:35:44,139 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:35:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 409 transitions. [2022-04-27 15:35:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-27 15:35:44,140 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:35:44,140 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:35:44,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:35:44,140 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:35:44,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:35:44,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1713860263, now seen corresponding path program 1 times [2022-04-27 15:35:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:35:44,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190348849] [2022-04-27 15:35:44,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:35:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:35:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:44,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:35:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:44,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {18207#(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); {18200#true} is VALID [2022-04-27 15:35:44,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {18200#true} assume true; {18200#true} is VALID [2022-04-27 15:35:44,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18200#true} {18200#true} #690#return; {18200#true} is VALID [2022-04-27 15:35:44,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {18200#true} call ULTIMATE.init(); {18207#(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:35:44,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {18207#(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); {18200#true} is VALID [2022-04-27 15:35:44,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {18200#true} assume true; {18200#true} is VALID [2022-04-27 15:35:44,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18200#true} {18200#true} #690#return; {18200#true} is VALID [2022-04-27 15:35:44,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {18200#true} call #t~ret161 := main(); {18200#true} is VALID [2022-04-27 15:35:44,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {18200#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; {18200#true} is VALID [2022-04-27 15:35:44,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {18200#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {18200#true} is VALID [2022-04-27 15:35:44,240 INFO L272 TraceCheckUtils]: 7: Hoare triple {18200#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18200#true} is VALID [2022-04-27 15:35:44,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {18200#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); {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:44,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {18205#(= 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; {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:44,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {18205#(= 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; {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:44,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {18205#(= 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)))); {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:44,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {18205#(= 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); {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:44,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {18205#(= 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; {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:44,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:44,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {18205#(= 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); {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:44,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {18205#(= 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); {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:44,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {18205#(= 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); {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:44,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {18205#(= 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); {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:44,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {18205#(= 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); {18206#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-27 15:35:44,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {18206#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {18201#false} is VALID [2022-04-27 15:35:44,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {18201#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {18201#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18201#false} is VALID [2022-04-27 15:35:44,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {18201#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {18201#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); {18201#false} is VALID [2022-04-27 15:35:44,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {18201#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {18201#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); {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {18201#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); {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {18201#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); {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {18201#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {18201#false} ~skip~0 := 0; {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {18201#false} assume !false; {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {18201#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); {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {18201#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {18201#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {18201#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {18201#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {18201#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {18201#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 39: Hoare triple {18201#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {18201#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 41: Hoare triple {18201#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {18201#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 43: Hoare triple {18201#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {18201#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {18201#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {18201#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {18201#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {18201#false} assume 8528 == #t~mem62;havoc #t~mem62; {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {18201#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); {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {18201#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; {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 51: Hoare triple {18201#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); {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {18201#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {18201#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 54: Hoare triple {18201#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 55: Hoare triple {18201#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 56: Hoare triple {18201#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); {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {18201#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18201#false} is VALID [2022-04-27 15:35:44,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {18201#false} ~skip~0 := 0; {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 59: Hoare triple {18201#false} assume !false; {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {18201#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); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {18201#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 62: Hoare triple {18201#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 63: Hoare triple {18201#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 64: Hoare triple {18201#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 65: Hoare triple {18201#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 66: Hoare triple {18201#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 67: Hoare triple {18201#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 68: Hoare triple {18201#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 69: Hoare triple {18201#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 70: Hoare triple {18201#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 71: Hoare triple {18201#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 72: Hoare triple {18201#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 73: Hoare triple {18201#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 74: Hoare triple {18201#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,249 INFO L290 TraceCheckUtils]: 75: Hoare triple {18201#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,250 INFO L290 TraceCheckUtils]: 76: Hoare triple {18201#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,250 INFO L290 TraceCheckUtils]: 77: Hoare triple {18201#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,250 INFO L290 TraceCheckUtils]: 78: Hoare triple {18201#false} assume 8544 == #t~mem64;havoc #t~mem64; {18201#false} is VALID [2022-04-27 15:35:44,250 INFO L290 TraceCheckUtils]: 79: Hoare triple {18201#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:35:44,250 INFO L290 TraceCheckUtils]: 80: Hoare triple {18201#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); {18201#false} is VALID [2022-04-27 15:35:44,250 INFO L290 TraceCheckUtils]: 81: Hoare triple {18201#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {18201#false} is VALID [2022-04-27 15:35:44,250 INFO L290 TraceCheckUtils]: 82: Hoare triple {18201#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); {18201#false} is VALID [2022-04-27 15:35:44,250 INFO L290 TraceCheckUtils]: 83: Hoare triple {18201#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; {18201#false} is VALID [2022-04-27 15:35:44,250 INFO L290 TraceCheckUtils]: 84: Hoare triple {18201#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; {18201#false} is VALID [2022-04-27 15:35:44,250 INFO L290 TraceCheckUtils]: 85: Hoare triple {18201#false} assume 7 == ~blastFlag~0; {18201#false} is VALID [2022-04-27 15:35:44,250 INFO L290 TraceCheckUtils]: 86: Hoare triple {18201#false} assume !false; {18201#false} is VALID [2022-04-27 15:35:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:35:44,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:35:44,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190348849] [2022-04-27 15:35:44,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190348849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:35:44,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:35:44,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:35:44,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903495785] [2022-04-27 15:35:44,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:35:44,251 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 87 [2022-04-27 15:35:44,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:35:44,252 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:35:44,293 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:35:44,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:35:44,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:35:44,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:35:44,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:35:44,294 INFO L87 Difference]: Start difference. First operand 261 states and 409 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:35:51,572 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:35:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:52,361 INFO L93 Difference]: Finished difference Result 499 states and 791 transitions. [2022-04-27 15:35:52,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:35:52,361 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 87 [2022-04-27 15:35:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:35:52,362 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:35:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-27 15:35:52,363 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:35:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-27 15:35:52,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-27 15:35:52,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:35:52,611 INFO L225 Difference]: With dead ends: 499 [2022-04-27 15:35:52,612 INFO L226 Difference]: Without dead ends: 264 [2022-04-27 15:35:52,612 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:35:52,612 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:35:52,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-27 15:35:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-27 15:35:52,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2022-04-27 15:35:52,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:35:52,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 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:35:52,617 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 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:35:52,617 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 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:35:52,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:52,620 INFO L93 Difference]: Finished difference Result 264 states and 412 transitions. [2022-04-27 15:35:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 412 transitions. [2022-04-27 15:35:52,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:52,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:52,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 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 264 states. [2022-04-27 15:35:52,621 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 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 264 states. [2022-04-27 15:35:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:52,625 INFO L93 Difference]: Finished difference Result 264 states and 412 transitions. [2022-04-27 15:35:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 412 transitions. [2022-04-27 15:35:52,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:52,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:52,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:35:52,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:35:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 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:35:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 408 transitions. [2022-04-27 15:35:52,629 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 408 transitions. Word has length 87 [2022-04-27 15:35:52,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:35:52,629 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 408 transitions. [2022-04-27 15:35:52,630 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:35:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 408 transitions. [2022-04-27 15:35:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-27 15:35:52,631 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:35:52,631 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:35:52,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:35:52,631 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:35:52,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:35:52,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1127555326, now seen corresponding path program 1 times [2022-04-27 15:35:52,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:35:52,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079859303] [2022-04-27 15:35:52,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:35:52,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:35:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:52,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:35:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:52,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {19609#(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); {19602#true} is VALID [2022-04-27 15:35:52,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {19602#true} assume true; {19602#true} is VALID [2022-04-27 15:35:52,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19602#true} {19602#true} #690#return; {19602#true} is VALID [2022-04-27 15:35:52,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {19602#true} call ULTIMATE.init(); {19609#(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:35:52,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {19609#(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); {19602#true} is VALID [2022-04-27 15:35:52,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {19602#true} assume true; {19602#true} is VALID [2022-04-27 15:35:52,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19602#true} {19602#true} #690#return; {19602#true} is VALID [2022-04-27 15:35:52,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {19602#true} call #t~ret161 := main(); {19602#true} is VALID [2022-04-27 15:35:52,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {19602#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; {19602#true} is VALID [2022-04-27 15:35:52,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {19602#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {19602#true} is VALID [2022-04-27 15:35:52,721 INFO L272 TraceCheckUtils]: 7: Hoare triple {19602#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19602#true} is VALID [2022-04-27 15:35:52,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {19602#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); {19602#true} is VALID [2022-04-27 15:35:52,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {19602#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; {19602#true} is VALID [2022-04-27 15:35:52,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {19602#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; {19602#true} is VALID [2022-04-27 15:35:52,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {19602#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19602#true} is VALID [2022-04-27 15:35:52,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {19602#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:35:52,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {19602#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {19602#true} is VALID [2022-04-27 15:35:52,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {19602#true} assume !false; {19602#true} is VALID [2022-04-27 15:35:52,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {19602#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); {19602#true} is VALID [2022-04-27 15:35:52,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {19602#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:35:52,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {19602#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:35:52,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {19602#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:35:52,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {19602#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:35:52,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {19602#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:35:52,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {19602#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:35:52,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {19602#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:35:52,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {19602#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:35:52,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {19602#true} assume 8464 == #t~mem55;havoc #t~mem55; {19602#true} is VALID [2022-04-27 15:35:52,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {19602#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; {19602#true} is VALID [2022-04-27 15:35:52,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {19602#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19602#true} is VALID [2022-04-27 15:35:52,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {19602#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); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {19607#(= 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); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {19607#(= 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; {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {19607#(= 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); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {19607#(= 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); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {19607#(= 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); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {19607#(= 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); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,726 INFO L290 TraceCheckUtils]: 36: Hoare triple {19607#(= 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); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {19607#(= 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); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {19607#(= 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); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {19607#(= 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); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {19607#(= 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); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {19607#(= 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); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,728 INFO L290 TraceCheckUtils]: 42: Hoare triple {19607#(= 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); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:35:52,728 INFO L290 TraceCheckUtils]: 43: Hoare triple {19607#(= 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); {19608#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-27 15:35:52,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {19608#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 45: Hoare triple {19603#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 46: Hoare triple {19603#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {19603#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {19603#false} assume 8528 == #t~mem62;havoc #t~mem62; {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {19603#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); {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {19603#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; {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {19603#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); {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {19603#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {19603#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {19603#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {19603#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {19603#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); {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {19603#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 58: Hoare triple {19603#false} ~skip~0 := 0; {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 59: Hoare triple {19603#false} assume !false; {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 60: Hoare triple {19603#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); {19603#false} is VALID [2022-04-27 15:35:52,729 INFO L290 TraceCheckUtils]: 61: Hoare triple {19603#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 62: Hoare triple {19603#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 63: Hoare triple {19603#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 64: Hoare triple {19603#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 65: Hoare triple {19603#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 66: Hoare triple {19603#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 67: Hoare triple {19603#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 68: Hoare triple {19603#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 69: Hoare triple {19603#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 70: Hoare triple {19603#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 71: Hoare triple {19603#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 72: Hoare triple {19603#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 73: Hoare triple {19603#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 74: Hoare triple {19603#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 75: Hoare triple {19603#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 76: Hoare triple {19603#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 77: Hoare triple {19603#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,730 INFO L290 TraceCheckUtils]: 78: Hoare triple {19603#false} assume 8544 == #t~mem64;havoc #t~mem64; {19603#false} is VALID [2022-04-27 15:35:52,731 INFO L290 TraceCheckUtils]: 79: Hoare triple {19603#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:35:52,731 INFO L290 TraceCheckUtils]: 80: Hoare triple {19603#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); {19603#false} is VALID [2022-04-27 15:35:52,731 INFO L290 TraceCheckUtils]: 81: Hoare triple {19603#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {19603#false} is VALID [2022-04-27 15:35:52,731 INFO L290 TraceCheckUtils]: 82: Hoare triple {19603#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); {19603#false} is VALID [2022-04-27 15:35:52,731 INFO L290 TraceCheckUtils]: 83: Hoare triple {19603#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; {19603#false} is VALID [2022-04-27 15:35:52,731 INFO L290 TraceCheckUtils]: 84: Hoare triple {19603#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; {19603#false} is VALID [2022-04-27 15:35:52,731 INFO L290 TraceCheckUtils]: 85: Hoare triple {19603#false} assume 7 == ~blastFlag~0; {19603#false} is VALID [2022-04-27 15:35:52,731 INFO L290 TraceCheckUtils]: 86: Hoare triple {19603#false} assume !false; {19603#false} is VALID [2022-04-27 15:35:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 15:35:52,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:35:52,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079859303] [2022-04-27 15:35:52,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079859303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:35:52,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:35:52,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:35:52,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625163455] [2022-04-27 15:35:52,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:35:52,732 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 87 [2022-04-27 15:35:52,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:35:52,732 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:35:52,789 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:35:52,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:35:52,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:35:52,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:35:52,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:35:52,790 INFO L87 Difference]: Start difference. First operand 261 states and 408 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:35:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:57,315 INFO L93 Difference]: Finished difference Result 537 states and 846 transitions. [2022-04-27 15:35:57,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:35:57,315 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 87 [2022-04-27 15:35:57,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:35:57,315 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:35:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-27 15:35:57,317 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:35:57,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-27 15:35:57,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-27 15:35:57,586 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:35:57,590 INFO L225 Difference]: With dead ends: 537 [2022-04-27 15:35:57,590 INFO L226 Difference]: Without dead ends: 302 [2022-04-27 15:35:57,591 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:35:57,591 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 30 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:35:57,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 507 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-27 15:35:57,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-27 15:35:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 283. [2022-04-27 15:35:57,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:35:57,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 302 states. Second operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 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:35:57,596 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 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:35:57,596 INFO L87 Difference]: Start difference. First operand 302 states. Second operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 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:35:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:57,600 INFO L93 Difference]: Finished difference Result 302 states and 467 transitions. [2022-04-27 15:35:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 467 transitions. [2022-04-27 15:35:57,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:57,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:57,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 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 302 states. [2022-04-27 15:35:57,601 INFO L87 Difference]: Start difference. First operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 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 302 states. [2022-04-27 15:35:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:35:57,605 INFO L93 Difference]: Finished difference Result 302 states and 467 transitions. [2022-04-27 15:35:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 467 transitions. [2022-04-27 15:35:57,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:35:57,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:35:57,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:35:57,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:35:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 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:35:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 442 transitions. [2022-04-27 15:35:57,610 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 442 transitions. Word has length 87 [2022-04-27 15:35:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:35:57,610 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 442 transitions. [2022-04-27 15:35:57,610 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:35:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 442 transitions. [2022-04-27 15:35:57,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 15:35:57,611 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:35:57,611 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:35:57,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:35:57,611 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:35:57,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:35:57,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1766336105, now seen corresponding path program 1 times [2022-04-27 15:35:57,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:35:57,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825314732] [2022-04-27 15:35:57,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:35:57,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:35:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:35:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:35:57,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {21154#(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); {21147#true} is VALID [2022-04-27 15:35:57,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {21147#true} assume true; {21147#true} is VALID [2022-04-27 15:35:57,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21147#true} {21147#true} #690#return; {21147#true} is VALID [2022-04-27 15:35:57,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {21147#true} call ULTIMATE.init(); {21154#(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:35:57,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {21154#(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); {21147#true} is VALID [2022-04-27 15:35:57,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {21147#true} assume true; {21147#true} is VALID [2022-04-27 15:35:57,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21147#true} {21147#true} #690#return; {21147#true} is VALID [2022-04-27 15:35:57,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {21147#true} call #t~ret161 := main(); {21147#true} is VALID [2022-04-27 15:35:57,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {21147#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; {21147#true} is VALID [2022-04-27 15:35:57,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {21147#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {21147#true} is VALID [2022-04-27 15:35:57,706 INFO L272 TraceCheckUtils]: 7: Hoare triple {21147#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21147#true} is VALID [2022-04-27 15:35:57,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {21147#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); {21147#true} is VALID [2022-04-27 15:35:57,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {21147#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; {21147#true} is VALID [2022-04-27 15:35:57,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {21147#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; {21147#true} is VALID [2022-04-27 15:35:57,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {21147#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {21147#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {21147#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {21147#true} assume !false; {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {21147#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); {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {21147#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {21147#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {21147#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {21147#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {21147#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {21147#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {21147#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {21147#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {21147#true} assume 8464 == #t~mem55;havoc #t~mem55; {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {21147#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; {21147#true} is VALID [2022-04-27 15:35:57,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {21147#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21147#true} is VALID [2022-04-27 15:35:57,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {21147#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); {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:57,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {21152#(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); {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:57,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {21152#(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; {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:57,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:57,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:57,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {21152#(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); {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:57,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {21152#(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); {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:57,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {21152#(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); {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:57,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {21152#(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); {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:57,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {21152#(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); {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:35:57,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {21152#(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); {21153#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-27 15:35:57,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {21153#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {21148#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; {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {21148#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); {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {21148#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); {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {21148#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {21148#false} ~skip~0 := 0; {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 44: Hoare triple {21148#false} assume !false; {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 45: Hoare triple {21148#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); {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 46: Hoare triple {21148#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 47: Hoare triple {21148#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 48: Hoare triple {21148#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 49: Hoare triple {21148#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 50: Hoare triple {21148#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 51: Hoare triple {21148#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 52: Hoare triple {21148#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 53: Hoare triple {21148#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 54: Hoare triple {21148#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,712 INFO L290 TraceCheckUtils]: 55: Hoare triple {21148#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 56: Hoare triple {21148#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 57: Hoare triple {21148#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 58: Hoare triple {21148#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 59: Hoare triple {21148#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 60: Hoare triple {21148#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 61: Hoare triple {21148#false} assume 8528 == #t~mem62;havoc #t~mem62; {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 62: Hoare triple {21148#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); {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 63: Hoare triple {21148#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; {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 64: Hoare triple {21148#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); {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 65: Hoare triple {21148#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {21148#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 67: Hoare triple {21148#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 68: Hoare triple {21148#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 69: Hoare triple {21148#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); {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 70: Hoare triple {21148#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 71: Hoare triple {21148#false} ~skip~0 := 0; {21148#false} is VALID [2022-04-27 15:35:57,713 INFO L290 TraceCheckUtils]: 72: Hoare triple {21148#false} assume !false; {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 73: Hoare triple {21148#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); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 74: Hoare triple {21148#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 75: Hoare triple {21148#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 76: Hoare triple {21148#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 77: Hoare triple {21148#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 78: Hoare triple {21148#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 79: Hoare triple {21148#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 80: Hoare triple {21148#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 81: Hoare triple {21148#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 82: Hoare triple {21148#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 83: Hoare triple {21148#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 84: Hoare triple {21148#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 85: Hoare triple {21148#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 86: Hoare triple {21148#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 87: Hoare triple {21148#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,714 INFO L290 TraceCheckUtils]: 88: Hoare triple {21148#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,715 INFO L290 TraceCheckUtils]: 89: Hoare triple {21148#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,715 INFO L290 TraceCheckUtils]: 90: Hoare triple {21148#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,715 INFO L290 TraceCheckUtils]: 91: Hoare triple {21148#false} assume 8544 == #t~mem64;havoc #t~mem64; {21148#false} is VALID [2022-04-27 15:35:57,715 INFO L290 TraceCheckUtils]: 92: Hoare triple {21148#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:35:57,715 INFO L290 TraceCheckUtils]: 93: Hoare triple {21148#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); {21148#false} is VALID [2022-04-27 15:35:57,715 INFO L290 TraceCheckUtils]: 94: Hoare triple {21148#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {21148#false} is VALID [2022-04-27 15:35:57,715 INFO L290 TraceCheckUtils]: 95: Hoare triple {21148#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); {21148#false} is VALID [2022-04-27 15:35:57,715 INFO L290 TraceCheckUtils]: 96: Hoare triple {21148#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; {21148#false} is VALID [2022-04-27 15:35:57,715 INFO L290 TraceCheckUtils]: 97: Hoare triple {21148#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; {21148#false} is VALID [2022-04-27 15:35:57,715 INFO L290 TraceCheckUtils]: 98: Hoare triple {21148#false} assume 7 == ~blastFlag~0; {21148#false} is VALID [2022-04-27 15:35:57,715 INFO L290 TraceCheckUtils]: 99: Hoare triple {21148#false} assume !false; {21148#false} is VALID [2022-04-27 15:35:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:35:57,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:35:57,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825314732] [2022-04-27 15:35:57,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825314732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:35:57,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:35:57,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:35:57,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746407814] [2022-04-27 15:35:57,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:35:57,716 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 100 [2022-04-27 15:35:57,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:35:57,717 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:35:57,765 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:35:57,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:35:57,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:35:57,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:35:57,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:35:57,766 INFO L87 Difference]: Start difference. First operand 283 states and 442 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:36:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:03,515 INFO L93 Difference]: Finished difference Result 657 states and 1030 transitions. [2022-04-27 15:36:03,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:36:03,516 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 100 [2022-04-27 15:36:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:36:03,516 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:36:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-27 15:36:03,518 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:36:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-27 15:36:03,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-27 15:36:03,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:03,896 INFO L225 Difference]: With dead ends: 657 [2022-04-27 15:36:03,897 INFO L226 Difference]: Without dead ends: 400 [2022-04-27 15:36:03,897 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:36:03,897 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 142 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:36:03,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 368 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-27 15:36:03,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-04-27 15:36:03,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 299. [2022-04-27 15:36:03,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:36:03,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 400 states. Second operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 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:36:03,903 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 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:36:03,903 INFO L87 Difference]: Start difference. First operand 400 states. Second operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 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:36:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:03,910 INFO L93 Difference]: Finished difference Result 400 states and 614 transitions. [2022-04-27 15:36:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2022-04-27 15:36:03,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:03,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:03,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 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 400 states. [2022-04-27 15:36:03,911 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 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 400 states. [2022-04-27 15:36:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:03,918 INFO L93 Difference]: Finished difference Result 400 states and 614 transitions. [2022-04-27 15:36:03,918 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2022-04-27 15:36:03,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:03,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:03,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:36:03,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:36:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 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:36:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 462 transitions. [2022-04-27 15:36:03,924 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 462 transitions. Word has length 100 [2022-04-27 15:36:03,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:36:03,924 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 462 transitions. [2022-04-27 15:36:03,924 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:36:03,924 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 462 transitions. [2022-04-27 15:36:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 15:36:03,925 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:36:03,925 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:36:03,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:36:03,925 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:36:03,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:36:03,926 INFO L85 PathProgramCache]: Analyzing trace with hash 500201960, now seen corresponding path program 1 times [2022-04-27 15:36:03,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:36:03,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513372350] [2022-04-27 15:36:03,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:36:03,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:36:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:04,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:36:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:04,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {23052#(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); {23045#true} is VALID [2022-04-27 15:36:04,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {23045#true} assume true; {23045#true} is VALID [2022-04-27 15:36:04,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23045#true} {23045#true} #690#return; {23045#true} is VALID [2022-04-27 15:36:04,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {23045#true} call ULTIMATE.init(); {23052#(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:36:04,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {23052#(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); {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {23045#true} assume true; {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23045#true} {23045#true} #690#return; {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {23045#true} call #t~ret161 := main(); {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {23045#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; {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {23045#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L272 TraceCheckUtils]: 7: Hoare triple {23045#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {23045#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); {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {23045#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; {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {23045#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; {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {23045#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {23045#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {23045#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {23045#true} assume !false; {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {23045#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); {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {23045#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:36:04,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {23045#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:36:04,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {23045#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:36:04,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {23045#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:36:04,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {23045#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:36:04,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {23045#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:36:04,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {23045#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:36:04,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {23045#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:36:04,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {23045#true} assume 8464 == #t~mem55;havoc #t~mem55; {23045#true} is VALID [2022-04-27 15:36:04,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {23045#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; {23045#true} is VALID [2022-04-27 15:36:04,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {23045#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23045#true} is VALID [2022-04-27 15:36:04,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {23045#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); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:36:04,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} 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); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:36:04,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:36:04,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:36:04,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:36:04,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {23050#(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); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:36:04,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {23050#(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); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:36:04,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {23050#(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); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:36:04,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {23050#(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); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:36:04,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {23050#(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); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:36:04,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {23050#(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); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:36:04,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {23050#(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); {23051#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-27 15:36:04,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {23051#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {23046#false} is VALID [2022-04-27 15:36:04,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {23046#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; {23046#false} is VALID [2022-04-27 15:36:04,039 INFO L290 TraceCheckUtils]: 41: Hoare triple {23046#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); {23046#false} is VALID [2022-04-27 15:36:04,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {23046#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); {23046#false} is VALID [2022-04-27 15:36:04,039 INFO L290 TraceCheckUtils]: 43: Hoare triple {23046#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23046#false} is VALID [2022-04-27 15:36:04,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {23046#false} ~skip~0 := 0; {23046#false} is VALID [2022-04-27 15:36:04,039 INFO L290 TraceCheckUtils]: 45: Hoare triple {23046#false} assume !false; {23046#false} is VALID [2022-04-27 15:36:04,039 INFO L290 TraceCheckUtils]: 46: Hoare triple {23046#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); {23046#false} is VALID [2022-04-27 15:36:04,039 INFO L290 TraceCheckUtils]: 47: Hoare triple {23046#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,039 INFO L290 TraceCheckUtils]: 48: Hoare triple {23046#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,039 INFO L290 TraceCheckUtils]: 49: Hoare triple {23046#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,039 INFO L290 TraceCheckUtils]: 50: Hoare triple {23046#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,039 INFO L290 TraceCheckUtils]: 51: Hoare triple {23046#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,040 INFO L290 TraceCheckUtils]: 52: Hoare triple {23046#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,040 INFO L290 TraceCheckUtils]: 53: Hoare triple {23046#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,040 INFO L290 TraceCheckUtils]: 54: Hoare triple {23046#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,040 INFO L290 TraceCheckUtils]: 55: Hoare triple {23046#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,040 INFO L290 TraceCheckUtils]: 56: Hoare triple {23046#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,040 INFO L290 TraceCheckUtils]: 57: Hoare triple {23046#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,040 INFO L290 TraceCheckUtils]: 58: Hoare triple {23046#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,040 INFO L290 TraceCheckUtils]: 59: Hoare triple {23046#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,040 INFO L290 TraceCheckUtils]: 60: Hoare triple {23046#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {23046#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,043 INFO L290 TraceCheckUtils]: 62: Hoare triple {23046#false} assume 8528 == #t~mem62;havoc #t~mem62; {23046#false} is VALID [2022-04-27 15:36:04,043 INFO L290 TraceCheckUtils]: 63: Hoare triple {23046#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); {23046#false} is VALID [2022-04-27 15:36:04,043 INFO L290 TraceCheckUtils]: 64: Hoare triple {23046#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; {23046#false} is VALID [2022-04-27 15:36:04,043 INFO L290 TraceCheckUtils]: 65: Hoare triple {23046#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); {23046#false} is VALID [2022-04-27 15:36:04,043 INFO L290 TraceCheckUtils]: 66: Hoare triple {23046#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {23046#false} is VALID [2022-04-27 15:36:04,043 INFO L290 TraceCheckUtils]: 67: Hoare triple {23046#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 68: Hoare triple {23046#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 69: Hoare triple {23046#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {23046#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); {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 71: Hoare triple {23046#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 72: Hoare triple {23046#false} ~skip~0 := 0; {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 73: Hoare triple {23046#false} assume !false; {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 74: Hoare triple {23046#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); {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 75: Hoare triple {23046#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 76: Hoare triple {23046#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 77: Hoare triple {23046#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 78: Hoare triple {23046#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 79: Hoare triple {23046#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 80: Hoare triple {23046#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 81: Hoare triple {23046#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 82: Hoare triple {23046#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 83: Hoare triple {23046#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,044 INFO L290 TraceCheckUtils]: 84: Hoare triple {23046#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 85: Hoare triple {23046#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 86: Hoare triple {23046#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 87: Hoare triple {23046#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 88: Hoare triple {23046#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 89: Hoare triple {23046#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 90: Hoare triple {23046#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 91: Hoare triple {23046#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 92: Hoare triple {23046#false} assume 8544 == #t~mem64;havoc #t~mem64; {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 93: Hoare triple {23046#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 94: Hoare triple {23046#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); {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 95: Hoare triple {23046#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 96: Hoare triple {23046#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); {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 97: Hoare triple {23046#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; {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 98: Hoare triple {23046#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; {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 99: Hoare triple {23046#false} assume 7 == ~blastFlag~0; {23046#false} is VALID [2022-04-27 15:36:04,045 INFO L290 TraceCheckUtils]: 100: Hoare triple {23046#false} assume !false; {23046#false} is VALID [2022-04-27 15:36:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:36:04,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:36:04,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513372350] [2022-04-27 15:36:04,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513372350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:36:04,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:36:04,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:36:04,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449656235] [2022-04-27 15:36:04,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:36:04,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 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 101 [2022-04-27 15:36:04,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:36:04,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 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:36:04,105 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:36:04,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:36:04,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:36:04,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:36:04,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:36:04,106 INFO L87 Difference]: Start difference. First operand 299 states and 462 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 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:36:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:08,256 INFO L93 Difference]: Finished difference Result 649 states and 1003 transitions. [2022-04-27 15:36:08,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:36:08,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 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 101 [2022-04-27 15:36:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:36:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 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:36:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-27 15:36:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 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:36:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-27 15:36:08,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-27 15:36:08,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:08,621 INFO L225 Difference]: With dead ends: 649 [2022-04-27 15:36:08,621 INFO L226 Difference]: Without dead ends: 376 [2022-04-27 15:36:08,622 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:36:08,622 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 141 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:36:08,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 368 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 15:36:08,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-04-27 15:36:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 299. [2022-04-27 15:36:08,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:36:08,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 376 states. Second operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 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:36:08,628 INFO L74 IsIncluded]: Start isIncluded. First operand 376 states. Second operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 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:36:08,628 INFO L87 Difference]: Start difference. First operand 376 states. Second operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 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:36:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:08,633 INFO L93 Difference]: Finished difference Result 376 states and 567 transitions. [2022-04-27 15:36:08,633 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 567 transitions. [2022-04-27 15:36:08,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:08,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:08,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 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:36:08,634 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 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:36:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:08,639 INFO L93 Difference]: Finished difference Result 376 states and 567 transitions. [2022-04-27 15:36:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 567 transitions. [2022-04-27 15:36:08,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:08,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:08,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:36:08,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:36:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 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:36:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 458 transitions. [2022-04-27 15:36:08,644 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 458 transitions. Word has length 101 [2022-04-27 15:36:08,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:36:08,644 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 458 transitions. [2022-04-27 15:36:08,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 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:36:08,645 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 458 transitions. [2022-04-27 15:36:08,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-27 15:36:08,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:36:08,645 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:36:08,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:36:08,646 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:36:08,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:36:08,646 INFO L85 PathProgramCache]: Analyzing trace with hash 264152850, now seen corresponding path program 1 times [2022-04-27 15:36:08,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:36:08,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650041554] [2022-04-27 15:36:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:36:08,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:36:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:08,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:36:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:08,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {24896#(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); {24889#true} is VALID [2022-04-27 15:36:08,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {24889#true} assume true; {24889#true} is VALID [2022-04-27 15:36:08,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24889#true} {24889#true} #690#return; {24889#true} is VALID [2022-04-27 15:36:08,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {24889#true} call ULTIMATE.init(); {24896#(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:36:08,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {24896#(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); {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {24889#true} assume true; {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24889#true} {24889#true} #690#return; {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {24889#true} call #t~ret161 := main(); {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {24889#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; {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {24889#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L272 TraceCheckUtils]: 7: Hoare triple {24889#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {24889#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); {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {24889#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; {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {24889#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; {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {24889#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {24889#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {24889#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {24889#true} assume !false; {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {24889#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); {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {24889#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:36:08,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {24889#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {24889#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {24889#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {24889#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {24889#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {24889#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {24889#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {24889#true} assume 8464 == #t~mem55;havoc #t~mem55; {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {24889#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; {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {24889#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {24889#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); {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {24889#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); {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {24889#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {24889#true} ~skip~0 := 0; {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {24889#true} assume !false; {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {24889#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); {24889#true} is VALID [2022-04-27 15:36:08,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {24889#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:36:08,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {24889#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:36:08,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {24889#true} assume 8192 == #t~mem49;havoc #t~mem49; {24889#true} is VALID [2022-04-27 15:36:08,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {24889#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:36:08,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {24889#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {24889#true} is VALID [2022-04-27 15:36:08,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {24889#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:36:08,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {24889#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); {24889#true} is VALID [2022-04-27 15:36:08,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {24889#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {24889#true} is VALID [2022-04-27 15:36:08,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {24889#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); {24889#true} is VALID [2022-04-27 15:36:08,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {24889#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); {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:08,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {24894#(= 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); {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:08,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {24894#(= 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; {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:08,744 INFO L290 TraceCheckUtils]: 45: Hoare triple {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:08,744 INFO L290 TraceCheckUtils]: 46: Hoare triple {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:08,744 INFO L290 TraceCheckUtils]: 47: Hoare triple {24894#(= 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); {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:08,745 INFO L290 TraceCheckUtils]: 48: Hoare triple {24894#(= 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); {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:08,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {24894#(= 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); {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:08,745 INFO L290 TraceCheckUtils]: 50: Hoare triple {24894#(= 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); {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:08,746 INFO L290 TraceCheckUtils]: 51: Hoare triple {24894#(= 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); {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:08,746 INFO L290 TraceCheckUtils]: 52: Hoare triple {24894#(= 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); {24895#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-27 15:36:08,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {24895#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {24890#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,746 INFO L290 TraceCheckUtils]: 55: Hoare triple {24890#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,746 INFO L290 TraceCheckUtils]: 56: Hoare triple {24890#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {24890#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 58: Hoare triple {24890#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 59: Hoare triple {24890#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 60: Hoare triple {24890#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 61: Hoare triple {24890#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 62: Hoare triple {24890#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 63: Hoare triple {24890#false} assume 8528 == #t~mem62;havoc #t~mem62; {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 64: Hoare triple {24890#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); {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 65: Hoare triple {24890#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; {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 66: Hoare triple {24890#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); {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 67: Hoare triple {24890#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 68: Hoare triple {24890#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 69: Hoare triple {24890#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 70: Hoare triple {24890#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 71: Hoare triple {24890#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); {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 72: Hoare triple {24890#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24890#false} is VALID [2022-04-27 15:36:08,747 INFO L290 TraceCheckUtils]: 73: Hoare triple {24890#false} ~skip~0 := 0; {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 74: Hoare triple {24890#false} assume !false; {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 75: Hoare triple {24890#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); {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 76: Hoare triple {24890#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 77: Hoare triple {24890#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 78: Hoare triple {24890#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 79: Hoare triple {24890#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 80: Hoare triple {24890#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 81: Hoare triple {24890#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 82: Hoare triple {24890#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 83: Hoare triple {24890#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 84: Hoare triple {24890#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 85: Hoare triple {24890#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 86: Hoare triple {24890#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 87: Hoare triple {24890#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 88: Hoare triple {24890#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,748 INFO L290 TraceCheckUtils]: 89: Hoare triple {24890#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,749 INFO L290 TraceCheckUtils]: 90: Hoare triple {24890#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,749 INFO L290 TraceCheckUtils]: 91: Hoare triple {24890#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,749 INFO L290 TraceCheckUtils]: 92: Hoare triple {24890#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,749 INFO L290 TraceCheckUtils]: 93: Hoare triple {24890#false} assume 8544 == #t~mem64;havoc #t~mem64; {24890#false} is VALID [2022-04-27 15:36:08,749 INFO L290 TraceCheckUtils]: 94: Hoare triple {24890#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:36:08,749 INFO L290 TraceCheckUtils]: 95: Hoare triple {24890#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); {24890#false} is VALID [2022-04-27 15:36:08,749 INFO L290 TraceCheckUtils]: 96: Hoare triple {24890#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {24890#false} is VALID [2022-04-27 15:36:08,749 INFO L290 TraceCheckUtils]: 97: Hoare triple {24890#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); {24890#false} is VALID [2022-04-27 15:36:08,749 INFO L290 TraceCheckUtils]: 98: Hoare triple {24890#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; {24890#false} is VALID [2022-04-27 15:36:08,749 INFO L290 TraceCheckUtils]: 99: Hoare triple {24890#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; {24890#false} is VALID [2022-04-27 15:36:08,749 INFO L290 TraceCheckUtils]: 100: Hoare triple {24890#false} assume 7 == ~blastFlag~0; {24890#false} is VALID [2022-04-27 15:36:08,749 INFO L290 TraceCheckUtils]: 101: Hoare triple {24890#false} assume !false; {24890#false} is VALID [2022-04-27 15:36:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 15:36:08,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:36:08,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650041554] [2022-04-27 15:36:08,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650041554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:36:08,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:36:08,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:36:08,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811906612] [2022-04-27 15:36:08,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:36:08,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 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 102 [2022-04-27 15:36:08,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:36:08,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 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:36:08,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:08,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:36:08,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:36:08,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:36:08,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:36:08,805 INFO L87 Difference]: Start difference. First operand 299 states and 458 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 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:36:12,816 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:36:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:16,161 INFO L93 Difference]: Finished difference Result 584 states and 901 transitions. [2022-04-27 15:36:16,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:36:16,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 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 102 [2022-04-27 15:36:16,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:36:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 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:36:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-04-27 15:36:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 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:36:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-04-27 15:36:16,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 450 transitions. [2022-04-27 15:36:16,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:16,433 INFO L225 Difference]: With dead ends: 584 [2022-04-27 15:36:16,434 INFO L226 Difference]: Without dead ends: 311 [2022-04-27 15:36:16,434 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:36:16,434 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 19 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:36:16,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 568 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 392 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-04-27 15:36:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-27 15:36:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 299. [2022-04-27 15:36:16,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:36:16,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 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:36:16,439 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 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:36:16,440 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 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:36:16,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:16,444 INFO L93 Difference]: Finished difference Result 311 states and 472 transitions. [2022-04-27 15:36:16,444 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 472 transitions. [2022-04-27 15:36:16,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:16,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:16,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 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 311 states. [2022-04-27 15:36:16,445 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 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 311 states. [2022-04-27 15:36:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:16,449 INFO L93 Difference]: Finished difference Result 311 states and 472 transitions. [2022-04-27 15:36:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 472 transitions. [2022-04-27 15:36:16,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:16,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:16,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:36:16,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:36:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 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:36:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 457 transitions. [2022-04-27 15:36:16,462 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 457 transitions. Word has length 102 [2022-04-27 15:36:16,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:36:16,462 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 457 transitions. [2022-04-27 15:36:16,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 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:36:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 457 transitions. [2022-04-27 15:36:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-27 15:36:16,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:36:16,463 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:36:16,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:36:16,464 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:36:16,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:36:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash -590509467, now seen corresponding path program 1 times [2022-04-27 15:36:16,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:36:16,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748294181] [2022-04-27 15:36:16,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:36:16,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:36:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:16,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:36:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:16,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {26528#(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); {26521#true} is VALID [2022-04-27 15:36:16,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {26521#true} assume true; {26521#true} is VALID [2022-04-27 15:36:16,564 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26521#true} {26521#true} #690#return; {26521#true} is VALID [2022-04-27 15:36:16,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {26521#true} call ULTIMATE.init(); {26528#(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:36:16,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {26528#(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); {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {26521#true} assume true; {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26521#true} {26521#true} #690#return; {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {26521#true} call #t~ret161 := main(); {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {26521#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; {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {26521#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L272 TraceCheckUtils]: 7: Hoare triple {26521#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {26521#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); {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {26521#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; {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {26521#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; {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {26521#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {26521#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {26521#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {26521#true} assume !false; {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {26521#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); {26521#true} is VALID [2022-04-27 15:36:16,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {26521#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:36:16,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {26521#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:36:16,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {26521#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:36:16,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {26521#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:36:16,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {26521#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:36:16,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {26521#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:36:16,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {26521#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:36:16,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {26521#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:36:16,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {26521#true} assume 8464 == #t~mem55;havoc #t~mem55; {26521#true} is VALID [2022-04-27 15:36:16,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {26521#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; {26521#true} is VALID [2022-04-27 15:36:16,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {26521#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26521#true} is VALID [2022-04-27 15:36:16,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {26521#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); {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:16,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {26526#(= 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); {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:16,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {26526#(= 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; {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:16,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:16,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:16,569 INFO L290 TraceCheckUtils]: 32: Hoare triple {26526#(= 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); {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:16,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {26526#(= 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); {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:16,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {26526#(= 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); {26527#(= |ssl3_accept_#t~mem49| 8496)} is VALID [2022-04-27 15:36:16,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {26527#(= |ssl3_accept_#t~mem49| 8496)} assume 8192 == #t~mem49;havoc #t~mem49; {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {26522#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {26522#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 38: Hoare triple {26522#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 39: Hoare triple {26522#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); {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 40: Hoare triple {26522#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 41: Hoare triple {26522#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); {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {26522#false} assume 12292 != #t~mem85;havoc #t~mem85; {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {26522#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; {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {26522#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); {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 45: Hoare triple {26522#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 46: Hoare triple {26522#false} ~skip~0 := 0; {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 47: Hoare triple {26522#false} assume !false; {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 48: Hoare triple {26522#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); {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {26522#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,570 INFO L290 TraceCheckUtils]: 50: Hoare triple {26522#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 51: Hoare triple {26522#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 52: Hoare triple {26522#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 53: Hoare triple {26522#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 54: Hoare triple {26522#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 55: Hoare triple {26522#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 56: Hoare triple {26522#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {26522#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 58: Hoare triple {26522#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 59: Hoare triple {26522#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 60: Hoare triple {26522#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {26522#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 62: Hoare triple {26522#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 63: Hoare triple {26522#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 64: Hoare triple {26522#false} assume 8528 == #t~mem62;havoc #t~mem62; {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 65: Hoare triple {26522#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); {26522#false} is VALID [2022-04-27 15:36:16,571 INFO L290 TraceCheckUtils]: 66: Hoare triple {26522#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; {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 67: Hoare triple {26522#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); {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 68: Hoare triple {26522#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 69: Hoare triple {26522#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 70: Hoare triple {26522#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 71: Hoare triple {26522#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 72: Hoare triple {26522#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); {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 73: Hoare triple {26522#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 74: Hoare triple {26522#false} ~skip~0 := 0; {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 75: Hoare triple {26522#false} assume !false; {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 76: Hoare triple {26522#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); {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 77: Hoare triple {26522#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 78: Hoare triple {26522#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 79: Hoare triple {26522#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 80: Hoare triple {26522#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 81: Hoare triple {26522#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 82: Hoare triple {26522#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,572 INFO L290 TraceCheckUtils]: 83: Hoare triple {26522#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 84: Hoare triple {26522#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 85: Hoare triple {26522#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 86: Hoare triple {26522#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 87: Hoare triple {26522#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 88: Hoare triple {26522#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 89: Hoare triple {26522#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 90: Hoare triple {26522#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 91: Hoare triple {26522#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 92: Hoare triple {26522#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 93: Hoare triple {26522#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 94: Hoare triple {26522#false} assume 8544 == #t~mem64;havoc #t~mem64; {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 95: Hoare triple {26522#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 96: Hoare triple {26522#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); {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 97: Hoare triple {26522#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 98: Hoare triple {26522#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); {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 99: Hoare triple {26522#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; {26522#false} is VALID [2022-04-27 15:36:16,573 INFO L290 TraceCheckUtils]: 100: Hoare triple {26522#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; {26522#false} is VALID [2022-04-27 15:36:16,574 INFO L290 TraceCheckUtils]: 101: Hoare triple {26522#false} assume 7 == ~blastFlag~0; {26522#false} is VALID [2022-04-27 15:36:16,574 INFO L290 TraceCheckUtils]: 102: Hoare triple {26522#false} assume !false; {26522#false} is VALID [2022-04-27 15:36:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:36:16,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:36:16,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748294181] [2022-04-27 15:36:16,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748294181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:36:16,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:36:16,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:36:16,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732289585] [2022-04-27 15:36:16,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:36:16,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 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 103 [2022-04-27 15:36:16,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:36:16,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 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:36:16,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:16,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:36:16,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:36:16,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:36:16,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:36:16,630 INFO L87 Difference]: Start difference. First operand 299 states and 457 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 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:36:18,659 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:36:19,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:19,530 INFO L93 Difference]: Finished difference Result 589 states and 907 transitions. [2022-04-27 15:36:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:36:19,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 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 103 [2022-04-27 15:36:19,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:36:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 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:36:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-27 15:36:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 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:36:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-27 15:36:19,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-27 15:36:19,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:19,806 INFO L225 Difference]: With dead ends: 589 [2022-04-27 15:36:19,806 INFO L226 Difference]: Without dead ends: 316 [2022-04-27 15:36:19,806 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:36:19,807 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 36 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:36:19,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 511 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:36:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-27 15:36:19,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 299. [2022-04-27 15:36:19,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:36:19,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 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:36:19,812 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 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:36:19,812 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 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:36:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:19,816 INFO L93 Difference]: Finished difference Result 316 states and 479 transitions. [2022-04-27 15:36:19,816 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 479 transitions. [2022-04-27 15:36:19,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:19,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:19,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 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 316 states. [2022-04-27 15:36:19,817 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 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 316 states. [2022-04-27 15:36:19,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:19,821 INFO L93 Difference]: Finished difference Result 316 states and 479 transitions. [2022-04-27 15:36:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 479 transitions. [2022-04-27 15:36:19,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:19,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:19,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:36:19,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:36:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 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:36:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 456 transitions. [2022-04-27 15:36:19,826 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 456 transitions. Word has length 103 [2022-04-27 15:36:19,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:36:19,826 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 456 transitions. [2022-04-27 15:36:19,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 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:36:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 456 transitions. [2022-04-27 15:36:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-27 15:36:19,827 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:36:19,827 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:36:19,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:36:19,828 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:36:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:36:19,828 INFO L85 PathProgramCache]: Analyzing trace with hash 708251584, now seen corresponding path program 1 times [2022-04-27 15:36:19,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:36:19,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25720376] [2022-04-27 15:36:19,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:36:19,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:36:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:19,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:36:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:19,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {28176#(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); {28169#true} is VALID [2022-04-27 15:36:19,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {28169#true} assume true; {28169#true} is VALID [2022-04-27 15:36:19,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28169#true} {28169#true} #690#return; {28169#true} is VALID [2022-04-27 15:36:19,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {28169#true} call ULTIMATE.init(); {28176#(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:36:19,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {28176#(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); {28169#true} is VALID [2022-04-27 15:36:19,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {28169#true} assume true; {28169#true} is VALID [2022-04-27 15:36:19,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28169#true} {28169#true} #690#return; {28169#true} is VALID [2022-04-27 15:36:19,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {28169#true} call #t~ret161 := main(); {28169#true} is VALID [2022-04-27 15:36:19,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {28169#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; {28169#true} is VALID [2022-04-27 15:36:19,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {28169#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {28169#true} is VALID [2022-04-27 15:36:19,933 INFO L272 TraceCheckUtils]: 7: Hoare triple {28169#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {28169#true} is VALID [2022-04-27 15:36:19,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {28169#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); {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {28169#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; {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {28169#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; {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {28169#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {28169#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {28169#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {28169#true} assume !false; {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {28169#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); {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {28169#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {28169#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {28169#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {28169#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {28169#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {28169#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {28169#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {28169#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:36:19,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {28169#true} assume 8464 == #t~mem55;havoc #t~mem55; {28169#true} is VALID [2022-04-27 15:36:19,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {28169#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; {28169#true} is VALID [2022-04-27 15:36:19,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {28169#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28169#true} is VALID [2022-04-27 15:36:19,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {28169#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); {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:19,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {28174#(= 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); {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:19,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {28174#(= 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; {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:19,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:19,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:19,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {28174#(= 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); {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:19,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {28174#(= 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); {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:19,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {28174#(= 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); {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:19,938 INFO L290 TraceCheckUtils]: 35: Hoare triple {28174#(= 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); {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:19,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {28174#(= 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); {28175#(= |ssl3_accept_#t~mem51| 8496)} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {28175#(= |ssl3_accept_#t~mem51| 8496)} assume 8195 == #t~mem51;havoc #t~mem51; {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {28170#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {28170#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {28170#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {28170#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); {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {28170#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {28170#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); {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {28170#false} assume 12292 != #t~mem85;havoc #t~mem85; {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {28170#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; {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {28170#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); {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 47: Hoare triple {28170#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {28170#false} ~skip~0 := 0; {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 49: Hoare triple {28170#false} assume !false; {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 50: Hoare triple {28170#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); {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 51: Hoare triple {28170#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,939 INFO L290 TraceCheckUtils]: 52: Hoare triple {28170#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {28170#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 54: Hoare triple {28170#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 55: Hoare triple {28170#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 56: Hoare triple {28170#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 57: Hoare triple {28170#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 58: Hoare triple {28170#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 59: Hoare triple {28170#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 60: Hoare triple {28170#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 61: Hoare triple {28170#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 62: Hoare triple {28170#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 63: Hoare triple {28170#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 64: Hoare triple {28170#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 65: Hoare triple {28170#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 66: Hoare triple {28170#false} assume 8528 == #t~mem62;havoc #t~mem62; {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 67: Hoare triple {28170#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); {28170#false} is VALID [2022-04-27 15:36:19,940 INFO L290 TraceCheckUtils]: 68: Hoare triple {28170#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; {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 69: Hoare triple {28170#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); {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 70: Hoare triple {28170#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 71: Hoare triple {28170#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 72: Hoare triple {28170#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 73: Hoare triple {28170#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 74: Hoare triple {28170#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); {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 75: Hoare triple {28170#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 76: Hoare triple {28170#false} ~skip~0 := 0; {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 77: Hoare triple {28170#false} assume !false; {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 78: Hoare triple {28170#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); {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 79: Hoare triple {28170#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 80: Hoare triple {28170#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 81: Hoare triple {28170#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 82: Hoare triple {28170#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 83: Hoare triple {28170#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 84: Hoare triple {28170#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,941 INFO L290 TraceCheckUtils]: 85: Hoare triple {28170#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 86: Hoare triple {28170#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 87: Hoare triple {28170#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 88: Hoare triple {28170#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 89: Hoare triple {28170#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 90: Hoare triple {28170#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 91: Hoare triple {28170#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 92: Hoare triple {28170#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 93: Hoare triple {28170#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 94: Hoare triple {28170#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 95: Hoare triple {28170#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 96: Hoare triple {28170#false} assume 8544 == #t~mem64;havoc #t~mem64; {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 97: Hoare triple {28170#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 98: Hoare triple {28170#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); {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 99: Hoare triple {28170#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 100: Hoare triple {28170#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); {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 101: Hoare triple {28170#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; {28170#false} is VALID [2022-04-27 15:36:19,942 INFO L290 TraceCheckUtils]: 102: Hoare triple {28170#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; {28170#false} is VALID [2022-04-27 15:36:19,943 INFO L290 TraceCheckUtils]: 103: Hoare triple {28170#false} assume 7 == ~blastFlag~0; {28170#false} is VALID [2022-04-27 15:36:19,943 INFO L290 TraceCheckUtils]: 104: Hoare triple {28170#false} assume !false; {28170#false} is VALID [2022-04-27 15:36:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:36:19,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:36:19,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25720376] [2022-04-27 15:36:19,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25720376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:36:19,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:36:19,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:36:19,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003077282] [2022-04-27 15:36:19,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:36:19,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 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 105 [2022-04-27 15:36:19,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:36:19,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 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:36:19,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:19,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:36:19,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:36:20,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:36:20,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:36:20,000 INFO L87 Difference]: Start difference. First operand 299 states and 456 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 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:36:24,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:36:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:25,879 INFO L93 Difference]: Finished difference Result 579 states and 892 transitions. [2022-04-27 15:36:25,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:36:25,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 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 105 [2022-04-27 15:36:25,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:36:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 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:36:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-27 15:36:25,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 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:36:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-27 15:36:25,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-27 15:36:26,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:26,145 INFO L225 Difference]: With dead ends: 579 [2022-04-27 15:36:26,145 INFO L226 Difference]: Without dead ends: 306 [2022-04-27 15:36:26,146 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:36:26,146 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 26 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:36:26,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 525 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-27 15:36:26,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-04-27 15:36:26,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 299. [2022-04-27 15:36:26,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:36:26,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 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:36:26,151 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 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:36:26,151 INFO L87 Difference]: Start difference. First operand 306 states. Second operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 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:36:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:26,155 INFO L93 Difference]: Finished difference Result 306 states and 465 transitions. [2022-04-27 15:36:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 465 transitions. [2022-04-27 15:36:26,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:26,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:26,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 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 306 states. [2022-04-27 15:36:26,156 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 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 306 states. [2022-04-27 15:36:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:26,160 INFO L93 Difference]: Finished difference Result 306 states and 465 transitions. [2022-04-27 15:36:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 465 transitions. [2022-04-27 15:36:26,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:26,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:26,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:36:26,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:36:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 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:36:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 455 transitions. [2022-04-27 15:36:26,164 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 455 transitions. Word has length 105 [2022-04-27 15:36:26,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:36:26,164 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 455 transitions. [2022-04-27 15:36:26,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 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:36:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 455 transitions. [2022-04-27 15:36:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-27 15:36:26,165 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:36:26,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:26,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:36:26,166 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:36:26,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:36:26,166 INFO L85 PathProgramCache]: Analyzing trace with hash -953511784, now seen corresponding path program 1 times [2022-04-27 15:36:26,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:36:26,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428601418] [2022-04-27 15:36:26,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:36:26,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:36:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:26,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:36:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:26,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {29793#(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); {29786#true} is VALID [2022-04-27 15:36:26,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {29786#true} assume true; {29786#true} is VALID [2022-04-27 15:36:26,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29786#true} {29786#true} #690#return; {29786#true} is VALID [2022-04-27 15:36:26,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {29786#true} call ULTIMATE.init(); {29793#(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:36:26,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {29793#(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); {29786#true} is VALID [2022-04-27 15:36:26,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {29786#true} assume true; {29786#true} is VALID [2022-04-27 15:36:26,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29786#true} {29786#true} #690#return; {29786#true} is VALID [2022-04-27 15:36:26,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {29786#true} call #t~ret161 := main(); {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {29786#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; {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {29786#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L272 TraceCheckUtils]: 7: Hoare triple {29786#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {29786#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); {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {29786#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; {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {29786#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; {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {29786#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {29786#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {29786#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {29786#true} assume !false; {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {29786#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); {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {29786#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {29786#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {29786#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {29786#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {29786#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {29786#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {29786#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {29786#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {29786#true} assume 8464 == #t~mem55;havoc #t~mem55; {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {29786#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; {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {29786#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {29786#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); {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {29786#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); {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {29786#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 30: Hoare triple {29786#true} ~skip~0 := 0; {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {29786#true} assume !false; {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {29786#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); {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {29786#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {29786#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {29786#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {29786#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {29786#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {29786#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {29786#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {29786#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {29786#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {29786#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,264 INFO L290 TraceCheckUtils]: 43: Hoare triple {29786#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {29786#true} assume 8496 == #t~mem58;havoc #t~mem58; {29786#true} is VALID [2022-04-27 15:36:26,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {29786#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {29786#true} is VALID [2022-04-27 15:36:26,264 INFO L290 TraceCheckUtils]: 46: Hoare triple {29786#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {29786#true} is VALID [2022-04-27 15:36:26,264 INFO L290 TraceCheckUtils]: 47: Hoare triple {29786#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:36:26,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {29786#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,266 INFO L290 TraceCheckUtils]: 50: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,266 INFO L290 TraceCheckUtils]: 51: Hoare triple {29791#(= 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; {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,266 INFO L290 TraceCheckUtils]: 52: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,267 INFO L290 TraceCheckUtils]: 55: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,267 INFO L290 TraceCheckUtils]: 56: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,268 INFO L290 TraceCheckUtils]: 57: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,268 INFO L290 TraceCheckUtils]: 58: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,268 INFO L290 TraceCheckUtils]: 59: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,269 INFO L290 TraceCheckUtils]: 60: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,269 INFO L290 TraceCheckUtils]: 61: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,269 INFO L290 TraceCheckUtils]: 62: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,270 INFO L290 TraceCheckUtils]: 63: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,270 INFO L290 TraceCheckUtils]: 64: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,270 INFO L290 TraceCheckUtils]: 65: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,270 INFO L290 TraceCheckUtils]: 66: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,271 INFO L290 TraceCheckUtils]: 67: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,271 INFO L290 TraceCheckUtils]: 68: Hoare triple {29791#(= 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); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:26,271 INFO L290 TraceCheckUtils]: 69: Hoare triple {29791#(= 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); {29792#(= |ssl3_accept_#t~mem62| 8656)} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 70: Hoare triple {29792#(= |ssl3_accept_#t~mem62| 8656)} assume 8528 == #t~mem62;havoc #t~mem62; {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 71: Hoare triple {29787#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); {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 72: Hoare triple {29787#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; {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 73: Hoare triple {29787#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); {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 74: Hoare triple {29787#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 75: Hoare triple {29787#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 76: Hoare triple {29787#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 77: Hoare triple {29787#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 78: Hoare triple {29787#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); {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 79: Hoare triple {29787#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 80: Hoare triple {29787#false} ~skip~0 := 0; {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 81: Hoare triple {29787#false} assume !false; {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 82: Hoare triple {29787#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); {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 83: Hoare triple {29787#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 84: Hoare triple {29787#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,272 INFO L290 TraceCheckUtils]: 85: Hoare triple {29787#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 86: Hoare triple {29787#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 87: Hoare triple {29787#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 88: Hoare triple {29787#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 89: Hoare triple {29787#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 90: Hoare triple {29787#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 91: Hoare triple {29787#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 92: Hoare triple {29787#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 93: Hoare triple {29787#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 94: Hoare triple {29787#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 95: Hoare triple {29787#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 96: Hoare triple {29787#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 97: Hoare triple {29787#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 98: Hoare triple {29787#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 99: Hoare triple {29787#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 100: Hoare triple {29787#false} assume 8544 == #t~mem64;havoc #t~mem64; {29787#false} is VALID [2022-04-27 15:36:26,273 INFO L290 TraceCheckUtils]: 101: Hoare triple {29787#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:36:26,274 INFO L290 TraceCheckUtils]: 102: Hoare triple {29787#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); {29787#false} is VALID [2022-04-27 15:36:26,274 INFO L290 TraceCheckUtils]: 103: Hoare triple {29787#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {29787#false} is VALID [2022-04-27 15:36:26,274 INFO L290 TraceCheckUtils]: 104: Hoare triple {29787#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); {29787#false} is VALID [2022-04-27 15:36:26,274 INFO L290 TraceCheckUtils]: 105: Hoare triple {29787#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; {29787#false} is VALID [2022-04-27 15:36:26,274 INFO L290 TraceCheckUtils]: 106: Hoare triple {29787#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; {29787#false} is VALID [2022-04-27 15:36:26,274 INFO L290 TraceCheckUtils]: 107: Hoare triple {29787#false} assume 7 == ~blastFlag~0; {29787#false} is VALID [2022-04-27 15:36:26,274 INFO L290 TraceCheckUtils]: 108: Hoare triple {29787#false} assume !false; {29787#false} is VALID [2022-04-27 15:36:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:36:26,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:36:26,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428601418] [2022-04-27 15:36:26,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428601418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:36:26,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:36:26,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:36:26,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88931321] [2022-04-27 15:36:26,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:36:26,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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 109 [2022-04-27 15:36:26,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:36:26,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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:36:26,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:26,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:36:26,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:36:26,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:36:26,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:36:26,335 INFO L87 Difference]: Start difference. First operand 299 states and 455 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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:36:27,614 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:36:29,621 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:36:31,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:36:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:33,708 INFO L93 Difference]: Finished difference Result 659 states and 1007 transitions. [2022-04-27 15:36:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:36:33,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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 109 [2022-04-27 15:36:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:36:33,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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:36:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2022-04-27 15:36:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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:36:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2022-04-27 15:36:33,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 538 transitions. [2022-04-27 15:36:34,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 538 edges. 538 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:34,025 INFO L225 Difference]: With dead ends: 659 [2022-04-27 15:36:34,025 INFO L226 Difference]: Without dead ends: 386 [2022-04-27 15:36:34,025 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:36:34,026 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 80 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:36:34,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 493 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 497 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-04-27 15:36:34,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-04-27 15:36:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 327. [2022-04-27 15:36:34,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:36:34,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 386 states. Second operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 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:36:34,031 INFO L74 IsIncluded]: Start isIncluded. First operand 386 states. Second operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 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:36:34,031 INFO L87 Difference]: Start difference. First operand 386 states. Second operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 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:36:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:34,037 INFO L93 Difference]: Finished difference Result 386 states and 581 transitions. [2022-04-27 15:36:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 581 transitions. [2022-04-27 15:36:34,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:34,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:34,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 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 386 states. [2022-04-27 15:36:34,038 INFO L87 Difference]: Start difference. First operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 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 386 states. [2022-04-27 15:36:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:34,044 INFO L93 Difference]: Finished difference Result 386 states and 581 transitions. [2022-04-27 15:36:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 581 transitions. [2022-04-27 15:36:34,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:34,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:34,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:36:34,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:36:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 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:36:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 497 transitions. [2022-04-27 15:36:34,050 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 497 transitions. Word has length 109 [2022-04-27 15:36:34,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:36:34,050 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 497 transitions. [2022-04-27 15:36:34,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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:36:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 497 transitions. [2022-04-27 15:36:34,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-27 15:36:34,051 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:36:34,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:34,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:36:34,051 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:36:34,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:36:34,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1008062874, now seen corresponding path program 1 times [2022-04-27 15:36:34,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:36:34,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671818865] [2022-04-27 15:36:34,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:36:34,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:36:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:34,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:36:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:34,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {31692#(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); {31685#true} is VALID [2022-04-27 15:36:34,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {31685#true} assume true; {31685#true} is VALID [2022-04-27 15:36:34,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31685#true} {31685#true} #690#return; {31685#true} is VALID [2022-04-27 15:36:34,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {31685#true} call ULTIMATE.init(); {31692#(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:36:34,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {31692#(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); {31685#true} is VALID [2022-04-27 15:36:34,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {31685#true} assume true; {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31685#true} {31685#true} #690#return; {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {31685#true} call #t~ret161 := main(); {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {31685#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; {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {31685#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L272 TraceCheckUtils]: 7: Hoare triple {31685#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {31685#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); {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {31685#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; {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {31685#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; {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {31685#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {31685#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {31685#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {31685#true} assume !false; {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {31685#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); {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {31685#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {31685#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {31685#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {31685#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {31685#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {31685#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {31685#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {31685#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {31685#true} assume 8464 == #t~mem55;havoc #t~mem55; {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {31685#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; {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {31685#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {31685#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); {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {31685#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); {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {31685#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {31685#true} ~skip~0 := 0; {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {31685#true} assume !false; {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {31685#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); {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {31685#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 34: Hoare triple {31685#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {31685#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {31685#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {31685#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {31685#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {31685#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,159 INFO L290 TraceCheckUtils]: 40: Hoare triple {31685#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,159 INFO L290 TraceCheckUtils]: 41: Hoare triple {31685#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {31685#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,159 INFO L290 TraceCheckUtils]: 43: Hoare triple {31685#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {31685#true} assume 8496 == #t~mem58;havoc #t~mem58; {31685#true} is VALID [2022-04-27 15:36:34,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {31685#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {31685#true} is VALID [2022-04-27 15:36:34,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {31685#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {31685#true} is VALID [2022-04-27 15:36:34,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {31685#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {31685#true} is VALID [2022-04-27 15:36:34,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {31685#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,160 INFO L290 TraceCheckUtils]: 49: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,161 INFO L290 TraceCheckUtils]: 50: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,161 INFO L290 TraceCheckUtils]: 51: Hoare triple {31690#(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; {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,161 INFO L290 TraceCheckUtils]: 52: Hoare triple {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,162 INFO L290 TraceCheckUtils]: 53: Hoare triple {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,162 INFO L290 TraceCheckUtils]: 54: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,162 INFO L290 TraceCheckUtils]: 55: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,164 INFO L290 TraceCheckUtils]: 59: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,164 INFO L290 TraceCheckUtils]: 60: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,164 INFO L290 TraceCheckUtils]: 61: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,165 INFO L290 TraceCheckUtils]: 62: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,165 INFO L290 TraceCheckUtils]: 63: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,165 INFO L290 TraceCheckUtils]: 64: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,166 INFO L290 TraceCheckUtils]: 65: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,166 INFO L290 TraceCheckUtils]: 66: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,166 INFO L290 TraceCheckUtils]: 67: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,166 INFO L290 TraceCheckUtils]: 68: Hoare triple {31690#(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); {31690#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:34,167 INFO L290 TraceCheckUtils]: 69: Hoare triple {31690#(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); {31691#(not (= |ssl3_accept_#t~mem62| 8528))} is VALID [2022-04-27 15:36:34,167 INFO L290 TraceCheckUtils]: 70: Hoare triple {31691#(not (= |ssl3_accept_#t~mem62| 8528))} assume 8528 == #t~mem62;havoc #t~mem62; {31686#false} is VALID [2022-04-27 15:36:34,167 INFO L290 TraceCheckUtils]: 71: Hoare triple {31686#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); {31686#false} is VALID [2022-04-27 15:36:34,167 INFO L290 TraceCheckUtils]: 72: Hoare triple {31686#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; {31686#false} is VALID [2022-04-27 15:36:34,167 INFO L290 TraceCheckUtils]: 73: Hoare triple {31686#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); {31686#false} is VALID [2022-04-27 15:36:34,167 INFO L290 TraceCheckUtils]: 74: Hoare triple {31686#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {31686#false} is VALID [2022-04-27 15:36:34,167 INFO L290 TraceCheckUtils]: 75: Hoare triple {31686#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {31686#false} is VALID [2022-04-27 15:36:34,167 INFO L290 TraceCheckUtils]: 76: Hoare triple {31686#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {31686#false} is VALID [2022-04-27 15:36:34,167 INFO L290 TraceCheckUtils]: 77: Hoare triple {31686#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 78: Hoare triple {31686#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); {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 79: Hoare triple {31686#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 80: Hoare triple {31686#false} ~skip~0 := 0; {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 81: Hoare triple {31686#false} assume !false; {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 82: Hoare triple {31686#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); {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 83: Hoare triple {31686#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 84: Hoare triple {31686#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 85: Hoare triple {31686#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 86: Hoare triple {31686#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 87: Hoare triple {31686#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 88: Hoare triple {31686#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 89: Hoare triple {31686#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 90: Hoare triple {31686#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 91: Hoare triple {31686#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 92: Hoare triple {31686#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 93: Hoare triple {31686#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,168 INFO L290 TraceCheckUtils]: 94: Hoare triple {31686#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,169 INFO L290 TraceCheckUtils]: 95: Hoare triple {31686#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,169 INFO L290 TraceCheckUtils]: 96: Hoare triple {31686#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,169 INFO L290 TraceCheckUtils]: 97: Hoare triple {31686#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,169 INFO L290 TraceCheckUtils]: 98: Hoare triple {31686#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,169 INFO L290 TraceCheckUtils]: 99: Hoare triple {31686#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,169 INFO L290 TraceCheckUtils]: 100: Hoare triple {31686#false} assume 8544 == #t~mem64;havoc #t~mem64; {31686#false} is VALID [2022-04-27 15:36:34,169 INFO L290 TraceCheckUtils]: 101: Hoare triple {31686#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {31686#false} is VALID [2022-04-27 15:36:34,169 INFO L290 TraceCheckUtils]: 102: Hoare triple {31686#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); {31686#false} is VALID [2022-04-27 15:36:34,169 INFO L290 TraceCheckUtils]: 103: Hoare triple {31686#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {31686#false} is VALID [2022-04-27 15:36:34,169 INFO L290 TraceCheckUtils]: 104: Hoare triple {31686#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); {31686#false} is VALID [2022-04-27 15:36:34,169 INFO L290 TraceCheckUtils]: 105: Hoare triple {31686#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; {31686#false} is VALID [2022-04-27 15:36:34,169 INFO L290 TraceCheckUtils]: 106: Hoare triple {31686#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; {31686#false} is VALID [2022-04-27 15:36:34,169 INFO L290 TraceCheckUtils]: 107: Hoare triple {31686#false} assume 7 == ~blastFlag~0; {31686#false} is VALID [2022-04-27 15:36:34,169 INFO L290 TraceCheckUtils]: 108: Hoare triple {31686#false} assume !false; {31686#false} is VALID [2022-04-27 15:36:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:36:34,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:36:34,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671818865] [2022-04-27 15:36:34,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671818865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:36:34,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:36:34,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:36:34,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274627810] [2022-04-27 15:36:34,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:36:34,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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 109 [2022-04-27 15:36:34,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:36:34,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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:36:34,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:34,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:36:34,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:36:34,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:36:34,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:36:34,264 INFO L87 Difference]: Start difference. First operand 327 states and 497 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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:36:36,283 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:36:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:37,319 INFO L93 Difference]: Finished difference Result 745 states and 1138 transitions. [2022-04-27 15:36:37,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:36:37,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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 109 [2022-04-27 15:36:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:36:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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:36:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-27 15:36:37,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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:36:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-27 15:36:37,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-27 15:36:37,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:37,693 INFO L225 Difference]: With dead ends: 745 [2022-04-27 15:36:37,693 INFO L226 Difference]: Without dead ends: 444 [2022-04-27 15:36:37,693 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:36:37,694 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 131 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:36:37,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 368 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 481 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:36:37,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-04-27 15:36:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 325. [2022-04-27 15:36:37,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:36:37,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 444 states. Second operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 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:36:37,711 INFO L74 IsIncluded]: Start isIncluded. First operand 444 states. Second operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 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:36:37,711 INFO L87 Difference]: Start difference. First operand 444 states. Second operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 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:36:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:37,718 INFO L93 Difference]: Finished difference Result 444 states and 668 transitions. [2022-04-27 15:36:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 668 transitions. [2022-04-27 15:36:37,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:37,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:37,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 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 444 states. [2022-04-27 15:36:37,732 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 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 444 states. [2022-04-27 15:36:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:37,740 INFO L93 Difference]: Finished difference Result 444 states and 668 transitions. [2022-04-27 15:36:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 668 transitions. [2022-04-27 15:36:37,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:37,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:37,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:36:37,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:36:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 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:36:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 493 transitions. [2022-04-27 15:36:37,745 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 493 transitions. Word has length 109 [2022-04-27 15:36:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:36:37,745 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 493 transitions. [2022-04-27 15:36:37,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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:36:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 493 transitions. [2022-04-27 15:36:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 15:36:37,746 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:36:37,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:37,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:36:37,746 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:36:37,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:36:37,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1785226605, now seen corresponding path program 1 times [2022-04-27 15:36:37,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:36:37,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130359239] [2022-04-27 15:36:37,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:36:37,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:36:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:37,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:36:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:37,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {33802#(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); {33795#true} is VALID [2022-04-27 15:36:37,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {33795#true} assume true; {33795#true} is VALID [2022-04-27 15:36:37,844 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33795#true} {33795#true} #690#return; {33795#true} is VALID [2022-04-27 15:36:37,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {33795#true} call ULTIMATE.init(); {33802#(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:36:37,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {33802#(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); {33795#true} is VALID [2022-04-27 15:36:37,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {33795#true} assume true; {33795#true} is VALID [2022-04-27 15:36:37,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33795#true} {33795#true} #690#return; {33795#true} is VALID [2022-04-27 15:36:37,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {33795#true} call #t~ret161 := main(); {33795#true} is VALID [2022-04-27 15:36:37,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {33795#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; {33795#true} is VALID [2022-04-27 15:36:37,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {33795#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,845 INFO L272 TraceCheckUtils]: 7: Hoare triple {33795#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {33795#true} is VALID [2022-04-27 15:36:37,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {33795#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); {33795#true} is VALID [2022-04-27 15:36:37,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {33795#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; {33795#true} is VALID [2022-04-27 15:36:37,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {33795#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; {33795#true} is VALID [2022-04-27 15:36:37,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {33795#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {33795#true} is VALID [2022-04-27 15:36:37,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {33795#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {33795#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {33795#true} is VALID [2022-04-27 15:36:37,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {33795#true} assume !false; {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {33795#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); {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {33795#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {33795#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {33795#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {33795#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {33795#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {33795#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {33795#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {33795#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {33795#true} assume 8464 == #t~mem55;havoc #t~mem55; {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {33795#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; {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {33795#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {33795#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); {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {33795#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); {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {33795#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33795#true} is VALID [2022-04-27 15:36:37,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {33795#true} ~skip~0 := 0; {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {33795#true} assume !false; {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {33795#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); {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {33795#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {33795#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {33795#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {33795#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {33795#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {33795#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {33795#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {33795#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {33795#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {33795#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 43: Hoare triple {33795#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 44: Hoare triple {33795#true} assume 8496 == #t~mem58;havoc #t~mem58; {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {33795#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {33795#true} is VALID [2022-04-27 15:36:37,847 INFO L290 TraceCheckUtils]: 46: Hoare triple {33795#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {33795#true} is VALID [2022-04-27 15:36:37,848 INFO L290 TraceCheckUtils]: 47: Hoare triple {33795#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {33795#true} is VALID [2022-04-27 15:36:37,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {33795#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,849 INFO L290 TraceCheckUtils]: 51: Hoare triple {33800#(= 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; {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,850 INFO L290 TraceCheckUtils]: 53: Hoare triple {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,850 INFO L290 TraceCheckUtils]: 54: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,850 INFO L290 TraceCheckUtils]: 55: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,851 INFO L290 TraceCheckUtils]: 56: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,851 INFO L290 TraceCheckUtils]: 57: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,851 INFO L290 TraceCheckUtils]: 58: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,852 INFO L290 TraceCheckUtils]: 60: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,852 INFO L290 TraceCheckUtils]: 61: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,853 INFO L290 TraceCheckUtils]: 63: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,853 INFO L290 TraceCheckUtils]: 64: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,853 INFO L290 TraceCheckUtils]: 65: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,854 INFO L290 TraceCheckUtils]: 66: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,854 INFO L290 TraceCheckUtils]: 67: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,854 INFO L290 TraceCheckUtils]: 68: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,855 INFO L290 TraceCheckUtils]: 69: Hoare triple {33800#(= 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); {33800#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:37,855 INFO L290 TraceCheckUtils]: 70: Hoare triple {33800#(= 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); {33801#(= |ssl3_accept_#t~mem63| 8656)} is VALID [2022-04-27 15:36:37,855 INFO L290 TraceCheckUtils]: 71: Hoare triple {33801#(= |ssl3_accept_#t~mem63| 8656)} assume 8529 == #t~mem63;havoc #t~mem63; {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 72: Hoare triple {33796#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); {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 73: Hoare triple {33796#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; {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 74: Hoare triple {33796#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); {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 75: Hoare triple {33796#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 76: Hoare triple {33796#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 77: Hoare triple {33796#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 78: Hoare triple {33796#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 79: Hoare triple {33796#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); {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 80: Hoare triple {33796#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 81: Hoare triple {33796#false} ~skip~0 := 0; {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 82: Hoare triple {33796#false} assume !false; {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 83: Hoare triple {33796#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); {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 84: Hoare triple {33796#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 85: Hoare triple {33796#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 86: Hoare triple {33796#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,856 INFO L290 TraceCheckUtils]: 87: Hoare triple {33796#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 88: Hoare triple {33796#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 89: Hoare triple {33796#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 90: Hoare triple {33796#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 91: Hoare triple {33796#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 92: Hoare triple {33796#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 93: Hoare triple {33796#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 94: Hoare triple {33796#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 95: Hoare triple {33796#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 96: Hoare triple {33796#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 97: Hoare triple {33796#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 98: Hoare triple {33796#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 99: Hoare triple {33796#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 100: Hoare triple {33796#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 101: Hoare triple {33796#false} assume 8544 == #t~mem64;havoc #t~mem64; {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 102: Hoare triple {33796#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 103: Hoare triple {33796#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); {33796#false} is VALID [2022-04-27 15:36:37,857 INFO L290 TraceCheckUtils]: 104: Hoare triple {33796#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {33796#false} is VALID [2022-04-27 15:36:37,858 INFO L290 TraceCheckUtils]: 105: Hoare triple {33796#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); {33796#false} is VALID [2022-04-27 15:36:37,858 INFO L290 TraceCheckUtils]: 106: Hoare triple {33796#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; {33796#false} is VALID [2022-04-27 15:36:37,858 INFO L290 TraceCheckUtils]: 107: Hoare triple {33796#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; {33796#false} is VALID [2022-04-27 15:36:37,858 INFO L290 TraceCheckUtils]: 108: Hoare triple {33796#false} assume 7 == ~blastFlag~0; {33796#false} is VALID [2022-04-27 15:36:37,858 INFO L290 TraceCheckUtils]: 109: Hoare triple {33796#false} assume !false; {33796#false} is VALID [2022-04-27 15:36:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:36:37,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:36:37,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130359239] [2022-04-27 15:36:37,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130359239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:36:37,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:36:37,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:36:37,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655311495] [2022-04-27 15:36:37,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:36:37,859 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 110 [2022-04-27 15:36:37,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:36:37,860 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:36:37,919 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:36:37,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:36:37,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:36:37,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:36:37,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:36:37,920 INFO L87 Difference]: Start difference. First operand 325 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:36:40,900 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:36:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:42,966 INFO L93 Difference]: Finished difference Result 709 states and 1079 transitions. [2022-04-27 15:36:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:36:42,966 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 110 [2022-04-27 15:36:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:36:42,966 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:36:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2022-04-27 15:36:42,968 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:36:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2022-04-27 15:36:42,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 534 transitions. [2022-04-27 15:36:43,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 534 edges. 534 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:43,287 INFO L225 Difference]: With dead ends: 709 [2022-04-27 15:36:43,287 INFO L226 Difference]: Without dead ends: 410 [2022-04-27 15:36:43,288 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:36:43,288 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 77 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:36:43,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 493 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 15:36:43,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-04-27 15:36:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 354. [2022-04-27 15:36:43,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:36:43,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 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:36:43,294 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 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:36:43,294 INFO L87 Difference]: Start difference. First operand 410 states. Second operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 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:36:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:43,300 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2022-04-27 15:36:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2022-04-27 15:36:43,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:43,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:43,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 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 410 states. [2022-04-27 15:36:43,302 INFO L87 Difference]: Start difference. First operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 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 410 states. [2022-04-27 15:36:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:43,308 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2022-04-27 15:36:43,308 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2022-04-27 15:36:43,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:43,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:43,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:36:43,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:36:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 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:36:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 536 transitions. [2022-04-27 15:36:43,314 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 536 transitions. Word has length 110 [2022-04-27 15:36:43,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:36:43,314 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 536 transitions. [2022-04-27 15:36:43,314 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:36:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 536 transitions. [2022-04-27 15:36:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 15:36:43,315 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:36:43,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:43,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:36:43,315 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:36:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:36:43,316 INFO L85 PathProgramCache]: Analyzing trace with hash -863733163, now seen corresponding path program 1 times [2022-04-27 15:36:43,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:36:43,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50615418] [2022-04-27 15:36:43,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:36:43,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:36:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:43,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:36:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:43,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {35831#(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); {35824#true} is VALID [2022-04-27 15:36:43,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {35824#true} assume true; {35824#true} is VALID [2022-04-27 15:36:43,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35824#true} {35824#true} #690#return; {35824#true} is VALID [2022-04-27 15:36:43,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {35824#true} call ULTIMATE.init(); {35831#(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:36:43,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {35831#(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); {35824#true} is VALID [2022-04-27 15:36:43,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {35824#true} assume true; {35824#true} is VALID [2022-04-27 15:36:43,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35824#true} {35824#true} #690#return; {35824#true} is VALID [2022-04-27 15:36:43,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {35824#true} call #t~ret161 := main(); {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {35824#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; {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {35824#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L272 TraceCheckUtils]: 7: Hoare triple {35824#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {35824#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); {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {35824#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; {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {35824#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; {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {35824#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {35824#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {35824#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {35824#true} assume !false; {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {35824#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); {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {35824#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {35824#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {35824#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {35824#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {35824#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {35824#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {35824#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {35824#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {35824#true} assume 8464 == #t~mem55;havoc #t~mem55; {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {35824#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; {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {35824#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {35824#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); {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {35824#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); {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {35824#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {35824#true} ~skip~0 := 0; {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {35824#true} assume !false; {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {35824#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); {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {35824#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {35824#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 35: Hoare triple {35824#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {35824#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {35824#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {35824#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,416 INFO L290 TraceCheckUtils]: 39: Hoare triple {35824#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {35824#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {35824#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {35824#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {35824#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,416 INFO L290 TraceCheckUtils]: 44: Hoare triple {35824#true} assume 8496 == #t~mem58;havoc #t~mem58; {35824#true} is VALID [2022-04-27 15:36:43,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {35824#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {35824#true} is VALID [2022-04-27 15:36:43,416 INFO L290 TraceCheckUtils]: 46: Hoare triple {35824#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {35824#true} is VALID [2022-04-27 15:36:43,416 INFO L290 TraceCheckUtils]: 47: Hoare triple {35824#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {35824#true} is VALID [2022-04-27 15:36:43,417 INFO L290 TraceCheckUtils]: 48: Hoare triple {35824#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,417 INFO L290 TraceCheckUtils]: 49: Hoare triple {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,418 INFO L290 TraceCheckUtils]: 50: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,418 INFO L290 TraceCheckUtils]: 51: Hoare triple {35829#(= 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; {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,418 INFO L290 TraceCheckUtils]: 52: Hoare triple {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,418 INFO L290 TraceCheckUtils]: 53: Hoare triple {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,419 INFO L290 TraceCheckUtils]: 54: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,419 INFO L290 TraceCheckUtils]: 55: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,419 INFO L290 TraceCheckUtils]: 56: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,420 INFO L290 TraceCheckUtils]: 58: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,420 INFO L290 TraceCheckUtils]: 59: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,421 INFO L290 TraceCheckUtils]: 60: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,421 INFO L290 TraceCheckUtils]: 61: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,421 INFO L290 TraceCheckUtils]: 62: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,421 INFO L290 TraceCheckUtils]: 63: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,422 INFO L290 TraceCheckUtils]: 64: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,422 INFO L290 TraceCheckUtils]: 65: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,422 INFO L290 TraceCheckUtils]: 66: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,423 INFO L290 TraceCheckUtils]: 67: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,423 INFO L290 TraceCheckUtils]: 68: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,423 INFO L290 TraceCheckUtils]: 69: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,424 INFO L290 TraceCheckUtils]: 70: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,424 INFO L290 TraceCheckUtils]: 71: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,424 INFO L290 TraceCheckUtils]: 72: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,424 INFO L290 TraceCheckUtils]: 73: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,425 INFO L290 TraceCheckUtils]: 74: Hoare triple {35829#(= 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); {35829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:36:43,425 INFO L290 TraceCheckUtils]: 75: Hoare triple {35829#(= 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); {35830#(= |ssl3_accept_#t~mem68| 8656)} is VALID [2022-04-27 15:36:43,425 INFO L290 TraceCheckUtils]: 76: Hoare triple {35830#(= |ssl3_accept_#t~mem68| 8656)} assume 8448 == #t~mem68;havoc #t~mem68; {35825#false} is VALID [2022-04-27 15:36:43,425 INFO L290 TraceCheckUtils]: 77: Hoare triple {35825#false} assume !(~num1~0 > 0); {35825#false} is VALID [2022-04-27 15:36:43,425 INFO L290 TraceCheckUtils]: 78: Hoare triple {35825#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; {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 79: Hoare triple {35825#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); {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 80: Hoare triple {35825#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 81: Hoare triple {35825#false} ~skip~0 := 0; {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 82: Hoare triple {35825#false} assume !false; {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 83: Hoare triple {35825#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); {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 84: Hoare triple {35825#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 85: Hoare triple {35825#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 86: Hoare triple {35825#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 87: Hoare triple {35825#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 88: Hoare triple {35825#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 89: Hoare triple {35825#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 90: Hoare triple {35825#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 91: Hoare triple {35825#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 92: Hoare triple {35825#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 93: Hoare triple {35825#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 94: Hoare triple {35825#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,426 INFO L290 TraceCheckUtils]: 95: Hoare triple {35825#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,427 INFO L290 TraceCheckUtils]: 96: Hoare triple {35825#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,427 INFO L290 TraceCheckUtils]: 97: Hoare triple {35825#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,427 INFO L290 TraceCheckUtils]: 98: Hoare triple {35825#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,427 INFO L290 TraceCheckUtils]: 99: Hoare triple {35825#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,427 INFO L290 TraceCheckUtils]: 100: Hoare triple {35825#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,427 INFO L290 TraceCheckUtils]: 101: Hoare triple {35825#false} assume 8544 == #t~mem64;havoc #t~mem64; {35825#false} is VALID [2022-04-27 15:36:43,427 INFO L290 TraceCheckUtils]: 102: Hoare triple {35825#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {35825#false} is VALID [2022-04-27 15:36:43,427 INFO L290 TraceCheckUtils]: 103: Hoare triple {35825#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); {35825#false} is VALID [2022-04-27 15:36:43,427 INFO L290 TraceCheckUtils]: 104: Hoare triple {35825#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {35825#false} is VALID [2022-04-27 15:36:43,427 INFO L290 TraceCheckUtils]: 105: Hoare triple {35825#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); {35825#false} is VALID [2022-04-27 15:36:43,427 INFO L290 TraceCheckUtils]: 106: Hoare triple {35825#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; {35825#false} is VALID [2022-04-27 15:36:43,427 INFO L290 TraceCheckUtils]: 107: Hoare triple {35825#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; {35825#false} is VALID [2022-04-27 15:36:43,427 INFO L290 TraceCheckUtils]: 108: Hoare triple {35825#false} assume 7 == ~blastFlag~0; {35825#false} is VALID [2022-04-27 15:36:43,427 INFO L290 TraceCheckUtils]: 109: Hoare triple {35825#false} assume !false; {35825#false} is VALID [2022-04-27 15:36:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:36:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:36:43,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50615418] [2022-04-27 15:36:43,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50615418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:36:43,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:36:43,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:36:43,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687724733] [2022-04-27 15:36:43,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:36:43,428 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 110 [2022-04-27 15:36:43,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:36:43,429 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:36:43,487 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:36:43,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:36:43,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:36:43,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:36:43,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:36:43,488 INFO L87 Difference]: Start difference. First operand 354 states and 536 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:36:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:50,933 INFO L93 Difference]: Finished difference Result 735 states and 1117 transitions. [2022-04-27 15:36:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:36:50,933 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 110 [2022-04-27 15:36:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:36:50,933 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:36:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2022-04-27 15:36:50,935 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:36:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2022-04-27 15:36:50,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 529 transitions. [2022-04-27 15:36:51,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:51,265 INFO L225 Difference]: With dead ends: 735 [2022-04-27 15:36:51,265 INFO L226 Difference]: Without dead ends: 407 [2022-04-27 15:36:51,266 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:36:51,266 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 70 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:36:51,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 499 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:36:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-04-27 15:36:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 359. [2022-04-27 15:36:51,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:36:51,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 407 states. Second operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 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:36:51,272 INFO L74 IsIncluded]: Start isIncluded. First operand 407 states. Second operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 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:36:51,272 INFO L87 Difference]: Start difference. First operand 407 states. Second operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 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:36:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:51,279 INFO L93 Difference]: Finished difference Result 407 states and 610 transitions. [2022-04-27 15:36:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2022-04-27 15:36:51,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:51,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:51,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 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 407 states. [2022-04-27 15:36:51,281 INFO L87 Difference]: Start difference. First operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 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 407 states. [2022-04-27 15:36:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:51,287 INFO L93 Difference]: Finished difference Result 407 states and 610 transitions. [2022-04-27 15:36:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2022-04-27 15:36:51,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:51,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:51,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:36:51,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:36:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 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:36:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 543 transitions. [2022-04-27 15:36:51,293 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 543 transitions. Word has length 110 [2022-04-27 15:36:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:36:51,293 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 543 transitions. [2022-04-27 15:36:51,294 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:36:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 543 transitions. [2022-04-27 15:36:51,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 15:36:51,295 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:36:51,295 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:51,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 15:36:51,295 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:36:51,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:36:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1830468437, now seen corresponding path program 1 times [2022-04-27 15:36:51,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:36:51,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994800508] [2022-04-27 15:36:51,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:36:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:36:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:51,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:36:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:51,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {37886#(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); {37879#true} is VALID [2022-04-27 15:36:51,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {37879#true} assume true; {37879#true} is VALID [2022-04-27 15:36:51,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37879#true} {37879#true} #690#return; {37879#true} is VALID [2022-04-27 15:36:51,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {37879#true} call ULTIMATE.init(); {37886#(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:36:51,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {37886#(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); {37879#true} is VALID [2022-04-27 15:36:51,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {37879#true} assume true; {37879#true} is VALID [2022-04-27 15:36:51,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37879#true} {37879#true} #690#return; {37879#true} is VALID [2022-04-27 15:36:51,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {37879#true} call #t~ret161 := main(); {37879#true} is VALID [2022-04-27 15:36:51,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {37879#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; {37879#true} is VALID [2022-04-27 15:36:51,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {37879#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,415 INFO L272 TraceCheckUtils]: 7: Hoare triple {37879#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {37879#true} is VALID [2022-04-27 15:36:51,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {37879#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); {37879#true} is VALID [2022-04-27 15:36:51,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {37879#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; {37879#true} is VALID [2022-04-27 15:36:51,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {37879#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; {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {37879#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {37879#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {37879#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {37879#true} assume !false; {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {37879#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); {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {37879#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {37879#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {37879#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {37879#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {37879#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {37879#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {37879#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {37879#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {37879#true} assume 8464 == #t~mem55;havoc #t~mem55; {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {37879#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; {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {37879#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37879#true} is VALID [2022-04-27 15:36:51,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {37879#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); {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {37879#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); {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {37879#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {37879#true} ~skip~0 := 0; {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {37879#true} assume !false; {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {37879#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); {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 33: Hoare triple {37879#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {37879#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {37879#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {37879#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {37879#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {37879#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {37879#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {37879#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {37879#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 42: Hoare triple {37879#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 43: Hoare triple {37879#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {37879#true} assume 8496 == #t~mem58;havoc #t~mem58; {37879#true} is VALID [2022-04-27 15:36:51,417 INFO L290 TraceCheckUtils]: 45: Hoare triple {37879#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {37879#true} is VALID [2022-04-27 15:36:51,418 INFO L290 TraceCheckUtils]: 46: Hoare triple {37879#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37879#true} is VALID [2022-04-27 15:36:51,418 INFO L290 TraceCheckUtils]: 47: Hoare triple {37879#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {37879#true} is VALID [2022-04-27 15:36:51,418 INFO L290 TraceCheckUtils]: 48: Hoare triple {37879#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,419 INFO L290 TraceCheckUtils]: 50: Hoare triple {37884#(= (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); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {37884#(= (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; {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,420 INFO L290 TraceCheckUtils]: 52: Hoare triple {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,420 INFO L290 TraceCheckUtils]: 53: Hoare triple {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,420 INFO L290 TraceCheckUtils]: 54: Hoare triple {37884#(= (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); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,421 INFO L290 TraceCheckUtils]: 55: Hoare triple {37884#(= (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); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,421 INFO L290 TraceCheckUtils]: 56: Hoare triple {37884#(= (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); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,421 INFO L290 TraceCheckUtils]: 57: Hoare triple {37884#(= (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); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,422 INFO L290 TraceCheckUtils]: 58: Hoare triple {37884#(= (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); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {37884#(= (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); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,422 INFO L290 TraceCheckUtils]: 60: Hoare triple {37884#(= (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); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,422 INFO L290 TraceCheckUtils]: 61: Hoare triple {37884#(= (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); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,423 INFO L290 TraceCheckUtils]: 62: Hoare triple {37884#(= (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); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,423 INFO L290 TraceCheckUtils]: 63: Hoare triple {37884#(= (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); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,423 INFO L290 TraceCheckUtils]: 64: Hoare triple {37884#(= (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); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,424 INFO L290 TraceCheckUtils]: 65: Hoare triple {37884#(= (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); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,424 INFO L290 TraceCheckUtils]: 66: Hoare triple {37884#(= (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); {37884#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:36:51,424 INFO L290 TraceCheckUtils]: 67: Hoare triple {37884#(= (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); {37885#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-27 15:36:51,424 INFO L290 TraceCheckUtils]: 68: Hoare triple {37885#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,424 INFO L290 TraceCheckUtils]: 69: Hoare triple {37880#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 70: Hoare triple {37880#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 71: Hoare triple {37880#false} assume 8529 == #t~mem63;havoc #t~mem63; {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 72: Hoare triple {37880#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); {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 73: Hoare triple {37880#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; {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 74: Hoare triple {37880#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); {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 75: Hoare triple {37880#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 76: Hoare triple {37880#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 77: Hoare triple {37880#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 78: Hoare triple {37880#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 79: Hoare triple {37880#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); {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 80: Hoare triple {37880#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 81: Hoare triple {37880#false} ~skip~0 := 0; {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 82: Hoare triple {37880#false} assume !false; {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 83: Hoare triple {37880#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); {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 84: Hoare triple {37880#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,425 INFO L290 TraceCheckUtils]: 85: Hoare triple {37880#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 86: Hoare triple {37880#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 87: Hoare triple {37880#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 88: Hoare triple {37880#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 89: Hoare triple {37880#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 90: Hoare triple {37880#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 91: Hoare triple {37880#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 92: Hoare triple {37880#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 93: Hoare triple {37880#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 94: Hoare triple {37880#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 95: Hoare triple {37880#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 96: Hoare triple {37880#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 97: Hoare triple {37880#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 98: Hoare triple {37880#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 99: Hoare triple {37880#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 100: Hoare triple {37880#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 101: Hoare triple {37880#false} assume 8544 == #t~mem64;havoc #t~mem64; {37880#false} is VALID [2022-04-27 15:36:51,426 INFO L290 TraceCheckUtils]: 102: Hoare triple {37880#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {37880#false} is VALID [2022-04-27 15:36:51,427 INFO L290 TraceCheckUtils]: 103: Hoare triple {37880#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); {37880#false} is VALID [2022-04-27 15:36:51,427 INFO L290 TraceCheckUtils]: 104: Hoare triple {37880#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {37880#false} is VALID [2022-04-27 15:36:51,427 INFO L290 TraceCheckUtils]: 105: Hoare triple {37880#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); {37880#false} is VALID [2022-04-27 15:36:51,427 INFO L290 TraceCheckUtils]: 106: Hoare triple {37880#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; {37880#false} is VALID [2022-04-27 15:36:51,427 INFO L290 TraceCheckUtils]: 107: Hoare triple {37880#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; {37880#false} is VALID [2022-04-27 15:36:51,427 INFO L290 TraceCheckUtils]: 108: Hoare triple {37880#false} assume 7 == ~blastFlag~0; {37880#false} is VALID [2022-04-27 15:36:51,427 INFO L290 TraceCheckUtils]: 109: Hoare triple {37880#false} assume !false; {37880#false} is VALID [2022-04-27 15:36:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 15:36:51,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:36:51,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994800508] [2022-04-27 15:36:51,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994800508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:36:51,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:36:51,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:36:51,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014953187] [2022-04-27 15:36:51,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:36:51,429 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 110 [2022-04-27 15:36:51,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:36:51,429 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:36:51,485 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:36:51,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:36:51,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:36:51,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:36:51,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:36:51,486 INFO L87 Difference]: Start difference. First operand 359 states and 543 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:36:55,116 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:36:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:58,499 INFO L93 Difference]: Finished difference Result 738 states and 1123 transitions. [2022-04-27 15:36:58,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:36:58,499 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 110 [2022-04-27 15:36:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:36:58,500 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:36:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-27 15:36:58,503 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:36:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-27 15:36:58,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-27 15:36:58,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:36:58,784 INFO L225 Difference]: With dead ends: 738 [2022-04-27 15:36:58,784 INFO L226 Difference]: Without dead ends: 405 [2022-04-27 15:36:58,784 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:36:58,785 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 36 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:36:58,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 603 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-27 15:36:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-27 15:36:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 383. [2022-04-27 15:36:58,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:36:58,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 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:36:58,790 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 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:36:58,791 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 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:36:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:58,797 INFO L93 Difference]: Finished difference Result 405 states and 609 transitions. [2022-04-27 15:36:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 609 transitions. [2022-04-27 15:36:58,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:58,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:58,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 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 405 states. [2022-04-27 15:36:58,798 INFO L87 Difference]: Start difference. First operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 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 405 states. [2022-04-27 15:36:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:36:58,805 INFO L93 Difference]: Finished difference Result 405 states and 609 transitions. [2022-04-27 15:36:58,805 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 609 transitions. [2022-04-27 15:36:58,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:36:58,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:36:58,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:36:58,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:36:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 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:36:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 579 transitions. [2022-04-27 15:36:58,811 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 579 transitions. Word has length 110 [2022-04-27 15:36:58,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:36:58,811 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 579 transitions. [2022-04-27 15:36:58,811 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:36:58,812 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 579 transitions. [2022-04-27 15:36:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-27 15:36:58,812 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:36:58,812 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] [2022-04-27 15:36:58,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 15:36:58,812 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:36:58,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:36:58,813 INFO L85 PathProgramCache]: Analyzing trace with hash 352037614, now seen corresponding path program 1 times [2022-04-27 15:36:58,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:36:58,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749267544] [2022-04-27 15:36:58,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:36:58,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:36:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:36:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:36:58,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {39962#(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); {39955#true} is VALID [2022-04-27 15:36:58,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {39955#true} assume true; {39955#true} is VALID [2022-04-27 15:36:58,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39955#true} {39955#true} #690#return; {39955#true} is VALID [2022-04-27 15:36:58,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {39955#true} call ULTIMATE.init(); {39962#(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:36:58,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {39962#(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); {39955#true} is VALID [2022-04-27 15:36:58,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {39955#true} assume true; {39955#true} is VALID [2022-04-27 15:36:58,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39955#true} {39955#true} #690#return; {39955#true} is VALID [2022-04-27 15:36:58,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {39955#true} call #t~ret161 := main(); {39955#true} is VALID [2022-04-27 15:36:58,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {39955#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; {39955#true} is VALID [2022-04-27 15:36:58,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {39955#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,926 INFO L272 TraceCheckUtils]: 7: Hoare triple {39955#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {39955#true} is VALID [2022-04-27 15:36:58,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {39955#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); {39955#true} is VALID [2022-04-27 15:36:58,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {39955#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; {39955#true} is VALID [2022-04-27 15:36:58,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {39955#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; {39955#true} is VALID [2022-04-27 15:36:58,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {39955#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {39955#true} is VALID [2022-04-27 15:36:58,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {39955#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {39955#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {39955#true} is VALID [2022-04-27 15:36:58,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {39955#true} assume !false; {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {39955#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); {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {39955#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {39955#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {39955#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {39955#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {39955#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {39955#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {39955#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {39955#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {39955#true} assume 8464 == #t~mem55;havoc #t~mem55; {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {39955#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; {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {39955#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {39955#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); {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {39955#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); {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {39955#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {39955#true} ~skip~0 := 0; {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {39955#true} assume !false; {39955#true} is VALID [2022-04-27 15:36:58,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {39955#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); {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {39955#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {39955#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {39955#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {39955#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {39955#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {39955#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {39955#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {39955#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {39955#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 42: Hoare triple {39955#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {39955#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 44: Hoare triple {39955#true} assume 8496 == #t~mem58;havoc #t~mem58; {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 45: Hoare triple {39955#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 46: Hoare triple {39955#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {39955#true} is VALID [2022-04-27 15:36:58,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {39955#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {39955#true} is VALID [2022-04-27 15:36:58,929 INFO L290 TraceCheckUtils]: 48: Hoare triple {39955#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,930 INFO L290 TraceCheckUtils]: 49: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,930 INFO L290 TraceCheckUtils]: 50: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {39960#(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; {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,931 INFO L290 TraceCheckUtils]: 52: Hoare triple {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,931 INFO L290 TraceCheckUtils]: 53: Hoare triple {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,931 INFO L290 TraceCheckUtils]: 54: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,931 INFO L290 TraceCheckUtils]: 55: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,932 INFO L290 TraceCheckUtils]: 56: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,932 INFO L290 TraceCheckUtils]: 57: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,932 INFO L290 TraceCheckUtils]: 58: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,933 INFO L290 TraceCheckUtils]: 59: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,933 INFO L290 TraceCheckUtils]: 60: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,933 INFO L290 TraceCheckUtils]: 61: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,934 INFO L290 TraceCheckUtils]: 62: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,934 INFO L290 TraceCheckUtils]: 63: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,935 INFO L290 TraceCheckUtils]: 65: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,935 INFO L290 TraceCheckUtils]: 66: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,935 INFO L290 TraceCheckUtils]: 67: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,936 INFO L290 TraceCheckUtils]: 68: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,936 INFO L290 TraceCheckUtils]: 69: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,936 INFO L290 TraceCheckUtils]: 70: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,937 INFO L290 TraceCheckUtils]: 71: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,937 INFO L290 TraceCheckUtils]: 72: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,937 INFO L290 TraceCheckUtils]: 73: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,937 INFO L290 TraceCheckUtils]: 74: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,938 INFO L290 TraceCheckUtils]: 75: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,938 INFO L290 TraceCheckUtils]: 76: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,938 INFO L290 TraceCheckUtils]: 77: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,939 INFO L290 TraceCheckUtils]: 78: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,939 INFO L290 TraceCheckUtils]: 79: Hoare triple {39960#(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); {39960#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:36:58,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {39960#(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); {39961#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 81: Hoare triple {39961#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {39956#false} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 82: Hoare triple {39956#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {39956#false} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 83: Hoare triple {39956#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); {39956#false} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 84: Hoare triple {39956#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); {39956#false} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 85: Hoare triple {39956#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39956#false} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 86: Hoare triple {39956#false} ~skip~0 := 0; {39956#false} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 87: Hoare triple {39956#false} assume !false; {39956#false} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 88: Hoare triple {39956#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); {39956#false} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 89: Hoare triple {39956#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 90: Hoare triple {39956#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 91: Hoare triple {39956#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 92: Hoare triple {39956#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 93: Hoare triple {39956#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 94: Hoare triple {39956#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,940 INFO L290 TraceCheckUtils]: 95: Hoare triple {39956#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 96: Hoare triple {39956#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 97: Hoare triple {39956#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 98: Hoare triple {39956#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 99: Hoare triple {39956#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 100: Hoare triple {39956#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 101: Hoare triple {39956#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 102: Hoare triple {39956#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 103: Hoare triple {39956#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 104: Hoare triple {39956#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 105: Hoare triple {39956#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 106: Hoare triple {39956#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 107: Hoare triple {39956#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 108: Hoare triple {39956#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 109: Hoare triple {39956#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 110: Hoare triple {39956#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 111: Hoare triple {39956#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,941 INFO L290 TraceCheckUtils]: 112: Hoare triple {39956#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,942 INFO L290 TraceCheckUtils]: 113: Hoare triple {39956#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,942 INFO L290 TraceCheckUtils]: 114: Hoare triple {39956#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,942 INFO L290 TraceCheckUtils]: 115: Hoare triple {39956#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,942 INFO L290 TraceCheckUtils]: 116: Hoare triple {39956#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {39956#false} is VALID [2022-04-27 15:36:58,942 INFO L290 TraceCheckUtils]: 117: Hoare triple {39956#false} assume 8640 == #t~mem75;havoc #t~mem75; {39956#false} is VALID [2022-04-27 15:36:58,942 INFO L290 TraceCheckUtils]: 118: Hoare triple {39956#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {39956#false} is VALID [2022-04-27 15:36:58,942 INFO L290 TraceCheckUtils]: 119: Hoare triple {39956#false} assume !(4 == ~blastFlag~0); {39956#false} is VALID [2022-04-27 15:36:58,942 INFO L290 TraceCheckUtils]: 120: Hoare triple {39956#false} assume 5 == ~blastFlag~0; {39956#false} is VALID [2022-04-27 15:36:58,942 INFO L290 TraceCheckUtils]: 121: Hoare triple {39956#false} assume !false; {39956#false} is VALID [2022-04-27 15:36:58,942 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:36:58,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:36:58,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749267544] [2022-04-27 15:36:58,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749267544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:36:58,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:36:58,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:36:58,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261982707] [2022-04-27 15:36:58,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:36:58,943 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 122 [2022-04-27 15:36:58,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:36:58,944 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:36:59,016 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:36:59,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:36:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:36:59,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:36:59,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:36:59,017 INFO L87 Difference]: Start difference. First operand 383 states and 579 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:37:00,791 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:37:02,369 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:37:05,036 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:37:06,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:06,023 INFO L93 Difference]: Finished difference Result 857 states and 1301 transitions. [2022-04-27 15:37:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:37:06,023 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 122 [2022-04-27 15:37:06,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:37:06,023 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:37:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-27 15:37:06,025 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:37:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-27 15:37:06,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-27 15:37:06,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:06,420 INFO L225 Difference]: With dead ends: 857 [2022-04-27 15:37:06,420 INFO L226 Difference]: Without dead ends: 500 [2022-04-27 15:37:06,421 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:37:06,421 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 120 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:37:06,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 346 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-27 15:37:06,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-04-27 15:37:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 420. [2022-04-27 15:37:06,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:37:06,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 500 states. Second operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 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:37:06,427 INFO L74 IsIncluded]: Start isIncluded. First operand 500 states. Second operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 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:37:06,427 INFO L87 Difference]: Start difference. First operand 500 states. Second operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 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:37:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:06,435 INFO L93 Difference]: Finished difference Result 500 states and 750 transitions. [2022-04-27 15:37:06,435 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 750 transitions. [2022-04-27 15:37:06,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:06,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:06,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 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 500 states. [2022-04-27 15:37:06,437 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 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 500 states. [2022-04-27 15:37:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:06,445 INFO L93 Difference]: Finished difference Result 500 states and 750 transitions. [2022-04-27 15:37:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 750 transitions. [2022-04-27 15:37:06,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:06,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:06,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:37:06,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:37:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 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:37:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 637 transitions. [2022-04-27 15:37:06,452 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 637 transitions. Word has length 122 [2022-04-27 15:37:06,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:37:06,453 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 637 transitions. [2022-04-27 15:37:06,453 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:37:06,453 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 637 transitions. [2022-04-27 15:37:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-27 15:37:06,453 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:37:06,453 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] [2022-04-27 15:37:06,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 15:37:06,454 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:37:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:37:06,454 INFO L85 PathProgramCache]: Analyzing trace with hash 988315678, now seen corresponding path program 1 times [2022-04-27 15:37:06,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:37:06,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464988975] [2022-04-27 15:37:06,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:37:06,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:37:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:06,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:37:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:06,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {42405#(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); {42398#true} is VALID [2022-04-27 15:37:06,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {42398#true} assume true; {42398#true} is VALID [2022-04-27 15:37:06,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42398#true} {42398#true} #690#return; {42398#true} is VALID [2022-04-27 15:37:06,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {42398#true} call ULTIMATE.init(); {42405#(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:37:06,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {42405#(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); {42398#true} is VALID [2022-04-27 15:37:06,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {42398#true} assume true; {42398#true} is VALID [2022-04-27 15:37:06,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42398#true} {42398#true} #690#return; {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {42398#true} call #t~ret161 := main(); {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {42398#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; {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {42398#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L272 TraceCheckUtils]: 7: Hoare triple {42398#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {42398#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); {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {42398#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; {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {42398#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; {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {42398#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {42398#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {42398#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {42398#true} assume !false; {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {42398#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); {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {42398#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {42398#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {42398#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {42398#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {42398#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {42398#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {42398#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {42398#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {42398#true} assume 8464 == #t~mem55;havoc #t~mem55; {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {42398#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; {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {42398#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {42398#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); {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {42398#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); {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {42398#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {42398#true} ~skip~0 := 0; {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {42398#true} assume !false; {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {42398#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); {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {42398#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {42398#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {42398#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {42398#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {42398#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {42398#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {42398#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {42398#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {42398#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {42398#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {42398#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {42398#true} assume 8496 == #t~mem58;havoc #t~mem58; {42398#true} is VALID [2022-04-27 15:37:06,557 INFO L290 TraceCheckUtils]: 45: Hoare triple {42398#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {42398#true} is VALID [2022-04-27 15:37:06,557 INFO L290 TraceCheckUtils]: 46: Hoare triple {42398#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {42398#true} is VALID [2022-04-27 15:37:06,557 INFO L290 TraceCheckUtils]: 47: Hoare triple {42398#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {42398#true} is VALID [2022-04-27 15:37:06,558 INFO L290 TraceCheckUtils]: 48: Hoare triple {42398#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,558 INFO L290 TraceCheckUtils]: 49: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} 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); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,559 INFO L290 TraceCheckUtils]: 51: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,559 INFO L290 TraceCheckUtils]: 53: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,560 INFO L290 TraceCheckUtils]: 54: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} 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); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,560 INFO L290 TraceCheckUtils]: 55: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,560 INFO L290 TraceCheckUtils]: 56: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,561 INFO L290 TraceCheckUtils]: 57: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,561 INFO L290 TraceCheckUtils]: 58: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,561 INFO L290 TraceCheckUtils]: 59: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,562 INFO L290 TraceCheckUtils]: 60: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,562 INFO L290 TraceCheckUtils]: 61: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,562 INFO L290 TraceCheckUtils]: 62: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,563 INFO L290 TraceCheckUtils]: 63: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,563 INFO L290 TraceCheckUtils]: 64: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,563 INFO L290 TraceCheckUtils]: 65: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,564 INFO L290 TraceCheckUtils]: 66: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,564 INFO L290 TraceCheckUtils]: 67: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,564 INFO L290 TraceCheckUtils]: 68: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,565 INFO L290 TraceCheckUtils]: 69: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,565 INFO L290 TraceCheckUtils]: 70: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,565 INFO L290 TraceCheckUtils]: 71: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,566 INFO L290 TraceCheckUtils]: 72: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,566 INFO L290 TraceCheckUtils]: 73: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,566 INFO L290 TraceCheckUtils]: 74: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,567 INFO L290 TraceCheckUtils]: 75: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,567 INFO L290 TraceCheckUtils]: 76: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,567 INFO L290 TraceCheckUtils]: 77: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,568 INFO L290 TraceCheckUtils]: 78: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,568 INFO L290 TraceCheckUtils]: 79: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,568 INFO L290 TraceCheckUtils]: 80: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:37:06,568 INFO L290 TraceCheckUtils]: 81: Hoare triple {42403#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {42404#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-27 15:37:06,569 INFO L290 TraceCheckUtils]: 82: Hoare triple {42404#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {42399#false} is VALID [2022-04-27 15:37:06,569 INFO L290 TraceCheckUtils]: 83: Hoare triple {42399#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {42399#false} is VALID [2022-04-27 15:37:06,569 INFO L290 TraceCheckUtils]: 84: Hoare triple {42399#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); {42399#false} is VALID [2022-04-27 15:37:06,569 INFO L290 TraceCheckUtils]: 85: Hoare triple {42399#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); {42399#false} is VALID [2022-04-27 15:37:06,569 INFO L290 TraceCheckUtils]: 86: Hoare triple {42399#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42399#false} is VALID [2022-04-27 15:37:06,569 INFO L290 TraceCheckUtils]: 87: Hoare triple {42399#false} ~skip~0 := 0; {42399#false} is VALID [2022-04-27 15:37:06,569 INFO L290 TraceCheckUtils]: 88: Hoare triple {42399#false} assume !false; {42399#false} is VALID [2022-04-27 15:37:06,569 INFO L290 TraceCheckUtils]: 89: Hoare triple {42399#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); {42399#false} is VALID [2022-04-27 15:37:06,569 INFO L290 TraceCheckUtils]: 90: Hoare triple {42399#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,569 INFO L290 TraceCheckUtils]: 91: Hoare triple {42399#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,569 INFO L290 TraceCheckUtils]: 92: Hoare triple {42399#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,569 INFO L290 TraceCheckUtils]: 93: Hoare triple {42399#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,569 INFO L290 TraceCheckUtils]: 94: Hoare triple {42399#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 95: Hoare triple {42399#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 96: Hoare triple {42399#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 97: Hoare triple {42399#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 98: Hoare triple {42399#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 99: Hoare triple {42399#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 100: Hoare triple {42399#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 101: Hoare triple {42399#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 102: Hoare triple {42399#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 103: Hoare triple {42399#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 104: Hoare triple {42399#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 105: Hoare triple {42399#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 106: Hoare triple {42399#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 107: Hoare triple {42399#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 108: Hoare triple {42399#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 109: Hoare triple {42399#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 110: Hoare triple {42399#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,570 INFO L290 TraceCheckUtils]: 111: Hoare triple {42399#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,571 INFO L290 TraceCheckUtils]: 112: Hoare triple {42399#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,571 INFO L290 TraceCheckUtils]: 113: Hoare triple {42399#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,571 INFO L290 TraceCheckUtils]: 114: Hoare triple {42399#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,571 INFO L290 TraceCheckUtils]: 115: Hoare triple {42399#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,571 INFO L290 TraceCheckUtils]: 116: Hoare triple {42399#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,571 INFO L290 TraceCheckUtils]: 117: Hoare triple {42399#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {42399#false} is VALID [2022-04-27 15:37:06,571 INFO L290 TraceCheckUtils]: 118: Hoare triple {42399#false} assume 8640 == #t~mem75;havoc #t~mem75; {42399#false} is VALID [2022-04-27 15:37:06,571 INFO L290 TraceCheckUtils]: 119: Hoare triple {42399#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {42399#false} is VALID [2022-04-27 15:37:06,571 INFO L290 TraceCheckUtils]: 120: Hoare triple {42399#false} assume !(4 == ~blastFlag~0); {42399#false} is VALID [2022-04-27 15:37:06,571 INFO L290 TraceCheckUtils]: 121: Hoare triple {42399#false} assume 5 == ~blastFlag~0; {42399#false} is VALID [2022-04-27 15:37:06,571 INFO L290 TraceCheckUtils]: 122: Hoare triple {42399#false} assume !false; {42399#false} is VALID [2022-04-27 15:37:06,571 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:37:06,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:37:06,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464988975] [2022-04-27 15:37:06,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464988975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:37:06,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:37:06,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:37:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829168973] [2022-04-27 15:37:06,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:37:06,572 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:37:06,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:37:06,573 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:37:06,639 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:37:06,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:37:06,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:37:06,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:37:06,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:37:06,640 INFO L87 Difference]: Start difference. First operand 420 states and 637 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:37:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:10,598 INFO L93 Difference]: Finished difference Result 891 states and 1353 transitions. [2022-04-27 15:37:10,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:37:10,599 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:37:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:37:10,599 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:37:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-27 15:37:10,601 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:37:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-27 15:37:10,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-27 15:37:10,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:10,963 INFO L225 Difference]: With dead ends: 891 [2022-04-27 15:37:10,963 INFO L226 Difference]: Without dead ends: 497 [2022-04-27 15:37:10,964 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:37:10,964 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 119 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:37:10,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 346 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 15:37:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-27 15:37:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 420. [2022-04-27 15:37:10,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:37:10,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 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:37:10,970 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 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:37:10,971 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 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:37:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:10,980 INFO L93 Difference]: Finished difference Result 497 states and 744 transitions. [2022-04-27 15:37:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 744 transitions. [2022-04-27 15:37:10,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:10,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:10,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 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 497 states. [2022-04-27 15:37:10,981 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 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 497 states. [2022-04-27 15:37:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:10,990 INFO L93 Difference]: Finished difference Result 497 states and 744 transitions. [2022-04-27 15:37:10,990 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 744 transitions. [2022-04-27 15:37:10,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:10,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:10,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:37:10,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:37:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 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:37:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 635 transitions. [2022-04-27 15:37:10,998 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 635 transitions. Word has length 123 [2022-04-27 15:37:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:37:10,998 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 635 transitions. [2022-04-27 15:37:10,998 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:37:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 635 transitions. [2022-04-27 15:37:10,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-27 15:37:10,999 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:37:10,999 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:37:10,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 15:37:11,000 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:37:11,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:37:11,000 INFO L85 PathProgramCache]: Analyzing trace with hash 863474282, now seen corresponding path program 1 times [2022-04-27 15:37:11,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:37:11,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881492813] [2022-04-27 15:37:11,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:37:11,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:37:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:11,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:37:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:11,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {44878#(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); {44871#true} is VALID [2022-04-27 15:37:11,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {44871#true} assume true; {44871#true} is VALID [2022-04-27 15:37:11,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44871#true} {44871#true} #690#return; {44871#true} is VALID [2022-04-27 15:37:11,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {44871#true} call ULTIMATE.init(); {44878#(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:37:11,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {44878#(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); {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {44871#true} assume true; {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44871#true} {44871#true} #690#return; {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {44871#true} call #t~ret161 := main(); {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {44871#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; {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {44871#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L272 TraceCheckUtils]: 7: Hoare triple {44871#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {44871#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); {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {44871#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; {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {44871#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; {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {44871#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {44871#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {44871#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {44871#true} assume !false; {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {44871#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); {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {44871#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {44871#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {44871#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {44871#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {44871#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {44871#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {44871#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {44871#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {44871#true} assume 8464 == #t~mem55;havoc #t~mem55; {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {44871#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; {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {44871#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {44871#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); {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {44871#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); {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {44871#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {44871#true} ~skip~0 := 0; {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {44871#true} assume !false; {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {44871#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); {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {44871#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {44871#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {44871#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {44871#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {44871#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {44871#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {44871#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,101 INFO L290 TraceCheckUtils]: 40: Hoare triple {44871#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {44871#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {44871#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,101 INFO L290 TraceCheckUtils]: 43: Hoare triple {44871#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {44871#true} assume 8496 == #t~mem58;havoc #t~mem58; {44871#true} is VALID [2022-04-27 15:37:11,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {44871#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {44871#true} is VALID [2022-04-27 15:37:11,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {44871#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44871#true} is VALID [2022-04-27 15:37:11,101 INFO L290 TraceCheckUtils]: 47: Hoare triple {44871#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {44871#true} is VALID [2022-04-27 15:37:11,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {44871#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {44876#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:37:11,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {44876#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44876#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:37:11,103 INFO L290 TraceCheckUtils]: 50: Hoare triple {44876#(= 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); {44876#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:37:11,103 INFO L290 TraceCheckUtils]: 51: Hoare triple {44876#(= 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; {44876#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:37:11,103 INFO L290 TraceCheckUtils]: 52: Hoare triple {44876#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {44876#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:37:11,104 INFO L290 TraceCheckUtils]: 53: Hoare triple {44876#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {44876#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:37:11,104 INFO L290 TraceCheckUtils]: 54: Hoare triple {44876#(= 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); {44876#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:37:11,104 INFO L290 TraceCheckUtils]: 55: Hoare triple {44876#(= 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); {44876#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:37:11,104 INFO L290 TraceCheckUtils]: 56: Hoare triple {44876#(= 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); {44877#(= |ssl3_accept_#t~mem49| 8656)} is VALID [2022-04-27 15:37:11,105 INFO L290 TraceCheckUtils]: 57: Hoare triple {44877#(= |ssl3_accept_#t~mem49| 8656)} assume 8192 == #t~mem49;havoc #t~mem49; {44872#false} is VALID [2022-04-27 15:37:11,105 INFO L290 TraceCheckUtils]: 58: Hoare triple {44872#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,105 INFO L290 TraceCheckUtils]: 59: Hoare triple {44872#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44872#false} is VALID [2022-04-27 15:37:11,105 INFO L290 TraceCheckUtils]: 60: Hoare triple {44872#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,105 INFO L290 TraceCheckUtils]: 61: Hoare triple {44872#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); {44872#false} is VALID [2022-04-27 15:37:11,105 INFO L290 TraceCheckUtils]: 62: Hoare triple {44872#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {44872#false} is VALID [2022-04-27 15:37:11,105 INFO L290 TraceCheckUtils]: 63: Hoare triple {44872#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); {44872#false} is VALID [2022-04-27 15:37:11,105 INFO L290 TraceCheckUtils]: 64: Hoare triple {44872#false} assume 12292 != #t~mem85;havoc #t~mem85; {44872#false} is VALID [2022-04-27 15:37:11,105 INFO L290 TraceCheckUtils]: 65: Hoare triple {44872#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; {44872#false} is VALID [2022-04-27 15:37:11,105 INFO L290 TraceCheckUtils]: 66: Hoare triple {44872#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); {44872#false} is VALID [2022-04-27 15:37:11,105 INFO L290 TraceCheckUtils]: 67: Hoare triple {44872#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44872#false} is VALID [2022-04-27 15:37:11,105 INFO L290 TraceCheckUtils]: 68: Hoare triple {44872#false} ~skip~0 := 0; {44872#false} is VALID [2022-04-27 15:37:11,105 INFO L290 TraceCheckUtils]: 69: Hoare triple {44872#false} assume !false; {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 70: Hoare triple {44872#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); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 71: Hoare triple {44872#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 72: Hoare triple {44872#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 73: Hoare triple {44872#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 74: Hoare triple {44872#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 75: Hoare triple {44872#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 76: Hoare triple {44872#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 77: Hoare triple {44872#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 78: Hoare triple {44872#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 79: Hoare triple {44872#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 80: Hoare triple {44872#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 81: Hoare triple {44872#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 82: Hoare triple {44872#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 83: Hoare triple {44872#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 84: Hoare triple {44872#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 85: Hoare triple {44872#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 86: Hoare triple {44872#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,106 INFO L290 TraceCheckUtils]: 87: Hoare triple {44872#false} assume 8529 == #t~mem63;havoc #t~mem63; {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 88: Hoare triple {44872#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); {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 89: Hoare triple {44872#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; {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 90: Hoare triple {44872#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); {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 91: Hoare triple {44872#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 92: Hoare triple {44872#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 93: Hoare triple {44872#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 94: Hoare triple {44872#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 95: Hoare triple {44872#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); {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 96: Hoare triple {44872#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 97: Hoare triple {44872#false} ~skip~0 := 0; {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 98: Hoare triple {44872#false} assume !false; {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 99: Hoare triple {44872#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); {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 100: Hoare triple {44872#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 101: Hoare triple {44872#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 102: Hoare triple {44872#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 103: Hoare triple {44872#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 104: Hoare triple {44872#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,107 INFO L290 TraceCheckUtils]: 105: Hoare triple {44872#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 106: Hoare triple {44872#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 107: Hoare triple {44872#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 108: Hoare triple {44872#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 109: Hoare triple {44872#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 110: Hoare triple {44872#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 111: Hoare triple {44872#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 112: Hoare triple {44872#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 113: Hoare triple {44872#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 114: Hoare triple {44872#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 115: Hoare triple {44872#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 116: Hoare triple {44872#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 117: Hoare triple {44872#false} assume 8544 == #t~mem64;havoc #t~mem64; {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 118: Hoare triple {44872#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 119: Hoare triple {44872#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); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 120: Hoare triple {44872#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 121: Hoare triple {44872#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); {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 122: Hoare triple {44872#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; {44872#false} is VALID [2022-04-27 15:37:11,108 INFO L290 TraceCheckUtils]: 123: Hoare triple {44872#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; {44872#false} is VALID [2022-04-27 15:37:11,109 INFO L290 TraceCheckUtils]: 124: Hoare triple {44872#false} assume 7 == ~blastFlag~0; {44872#false} is VALID [2022-04-27 15:37:11,109 INFO L290 TraceCheckUtils]: 125: Hoare triple {44872#false} assume !false; {44872#false} is VALID [2022-04-27 15:37:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-27 15:37:11,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:37:11,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881492813] [2022-04-27 15:37:11,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881492813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:37:11,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:37:11,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:37:11,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423449138] [2022-04-27 15:37:11,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:37:11,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 126 [2022-04-27 15:37:11,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:37:11,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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:37:11,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:11,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:37:11,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:37:11,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:37:11,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:37:11,170 INFO L87 Difference]: Start difference. First operand 420 states and 635 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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:37:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:16,854 INFO L93 Difference]: Finished difference Result 860 states and 1303 transitions. [2022-04-27 15:37:16,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:37:16,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 126 [2022-04-27 15:37:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:37:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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:37:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2022-04-27 15:37:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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:37:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2022-04-27 15:37:16,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 524 transitions. [2022-04-27 15:37:17,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:17,162 INFO L225 Difference]: With dead ends: 860 [2022-04-27 15:37:17,162 INFO L226 Difference]: Without dead ends: 466 [2022-04-27 15:37:17,162 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:37:17,163 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 85 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:37:17,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 525 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 15:37:17,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-04-27 15:37:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 420. [2022-04-27 15:37:17,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:37:17,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 466 states. Second operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 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:37:17,169 INFO L74 IsIncluded]: Start isIncluded. First operand 466 states. Second operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 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:37:17,169 INFO L87 Difference]: Start difference. First operand 466 states. Second operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 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:37:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:17,176 INFO L93 Difference]: Finished difference Result 466 states and 697 transitions. [2022-04-27 15:37:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 697 transitions. [2022-04-27 15:37:17,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:17,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:17,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 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 466 states. [2022-04-27 15:37:17,178 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 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 466 states. [2022-04-27 15:37:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:17,186 INFO L93 Difference]: Finished difference Result 466 states and 697 transitions. [2022-04-27 15:37:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 697 transitions. [2022-04-27 15:37:17,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:17,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:17,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:37:17,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:37:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 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:37:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 634 transitions. [2022-04-27 15:37:17,194 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 634 transitions. Word has length 126 [2022-04-27 15:37:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:37:17,194 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 634 transitions. [2022-04-27 15:37:17,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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:37:17,194 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 634 transitions. [2022-04-27 15:37:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-27 15:37:17,195 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:37:17,195 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:37:17,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-27 15:37:17,195 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:37:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:37:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1702507944, now seen corresponding path program 1 times [2022-04-27 15:37:17,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:37:17,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270024195] [2022-04-27 15:37:17,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:37:17,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:37:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:17,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:37:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:17,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {47248#(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); {47241#true} is VALID [2022-04-27 15:37:17,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {47241#true} assume true; {47241#true} is VALID [2022-04-27 15:37:17,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47241#true} {47241#true} #690#return; {47241#true} is VALID [2022-04-27 15:37:17,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {47241#true} call ULTIMATE.init(); {47248#(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:37:17,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {47248#(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); {47241#true} is VALID [2022-04-27 15:37:17,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {47241#true} assume true; {47241#true} is VALID [2022-04-27 15:37:17,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47241#true} {47241#true} #690#return; {47241#true} is VALID [2022-04-27 15:37:17,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {47241#true} call #t~ret161 := main(); {47241#true} is VALID [2022-04-27 15:37:17,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {47241#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; {47241#true} is VALID [2022-04-27 15:37:17,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {47241#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,304 INFO L272 TraceCheckUtils]: 7: Hoare triple {47241#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {47241#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); {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {47241#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; {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {47241#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; {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {47241#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {47241#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {47241#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {47241#true} assume !false; {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {47241#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); {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {47241#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {47241#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {47241#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {47241#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {47241#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {47241#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {47241#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {47241#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {47241#true} assume 8464 == #t~mem55;havoc #t~mem55; {47241#true} is VALID [2022-04-27 15:37:17,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {47241#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; {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {47241#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {47241#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); {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {47241#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); {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {47241#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {47241#true} ~skip~0 := 0; {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {47241#true} assume !false; {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {47241#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); {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {47241#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {47241#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {47241#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {47241#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {47241#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {47241#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 39: Hoare triple {47241#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 40: Hoare triple {47241#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 41: Hoare triple {47241#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {47241#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,307 INFO L290 TraceCheckUtils]: 43: Hoare triple {47241#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,307 INFO L290 TraceCheckUtils]: 44: Hoare triple {47241#true} assume 8496 == #t~mem58;havoc #t~mem58; {47241#true} is VALID [2022-04-27 15:37:17,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {47241#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {47241#true} is VALID [2022-04-27 15:37:17,307 INFO L290 TraceCheckUtils]: 46: Hoare triple {47241#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {47241#true} is VALID [2022-04-27 15:37:17,307 INFO L290 TraceCheckUtils]: 47: Hoare triple {47241#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {47241#true} is VALID [2022-04-27 15:37:17,307 INFO L290 TraceCheckUtils]: 48: Hoare triple {47241#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {47246#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:37:17,308 INFO L290 TraceCheckUtils]: 49: Hoare triple {47246#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {47246#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:37:17,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {47246#(= (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); {47246#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:37:17,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {47246#(= (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; {47246#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:37:17,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {47246#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {47246#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:37:17,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {47246#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {47246#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:37:17,310 INFO L290 TraceCheckUtils]: 54: Hoare triple {47246#(= (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); {47246#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:37:17,310 INFO L290 TraceCheckUtils]: 55: Hoare triple {47246#(= (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); {47246#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:37:17,310 INFO L290 TraceCheckUtils]: 56: Hoare triple {47246#(= (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); {47247#(= |ssl3_accept_#t~mem49| 8512)} is VALID [2022-04-27 15:37:17,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {47247#(= |ssl3_accept_#t~mem49| 8512)} assume 8192 == #t~mem49;havoc #t~mem49; {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 58: Hoare triple {47242#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 59: Hoare triple {47242#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 60: Hoare triple {47242#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 61: Hoare triple {47242#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); {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 62: Hoare triple {47242#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 63: Hoare triple {47242#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); {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 64: Hoare triple {47242#false} assume 12292 != #t~mem85;havoc #t~mem85; {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 65: Hoare triple {47242#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; {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 66: Hoare triple {47242#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); {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 67: Hoare triple {47242#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 68: Hoare triple {47242#false} ~skip~0 := 0; {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 69: Hoare triple {47242#false} assume !false; {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 70: Hoare triple {47242#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); {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 71: Hoare triple {47242#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 72: Hoare triple {47242#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 73: Hoare triple {47242#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 74: Hoare triple {47242#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,311 INFO L290 TraceCheckUtils]: 75: Hoare triple {47242#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 76: Hoare triple {47242#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 77: Hoare triple {47242#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 78: Hoare triple {47242#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 79: Hoare triple {47242#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 80: Hoare triple {47242#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 81: Hoare triple {47242#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 82: Hoare triple {47242#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 83: Hoare triple {47242#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 84: Hoare triple {47242#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 85: Hoare triple {47242#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 86: Hoare triple {47242#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 87: Hoare triple {47242#false} assume 8529 == #t~mem63;havoc #t~mem63; {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 88: Hoare triple {47242#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); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 89: Hoare triple {47242#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; {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 90: Hoare triple {47242#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); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 91: Hoare triple {47242#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 92: Hoare triple {47242#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {47242#false} is VALID [2022-04-27 15:37:17,312 INFO L290 TraceCheckUtils]: 93: Hoare triple {47242#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 94: Hoare triple {47242#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 95: Hoare triple {47242#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); {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 96: Hoare triple {47242#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 97: Hoare triple {47242#false} ~skip~0 := 0; {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 98: Hoare triple {47242#false} assume !false; {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 99: Hoare triple {47242#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); {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 100: Hoare triple {47242#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 101: Hoare triple {47242#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 102: Hoare triple {47242#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 103: Hoare triple {47242#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 104: Hoare triple {47242#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 105: Hoare triple {47242#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 106: Hoare triple {47242#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 107: Hoare triple {47242#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 108: Hoare triple {47242#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 109: Hoare triple {47242#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 110: Hoare triple {47242#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,313 INFO L290 TraceCheckUtils]: 111: Hoare triple {47242#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,314 INFO L290 TraceCheckUtils]: 112: Hoare triple {47242#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,314 INFO L290 TraceCheckUtils]: 113: Hoare triple {47242#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,314 INFO L290 TraceCheckUtils]: 114: Hoare triple {47242#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,314 INFO L290 TraceCheckUtils]: 115: Hoare triple {47242#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,314 INFO L290 TraceCheckUtils]: 116: Hoare triple {47242#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,314 INFO L290 TraceCheckUtils]: 117: Hoare triple {47242#false} assume 8544 == #t~mem64;havoc #t~mem64; {47242#false} is VALID [2022-04-27 15:37:17,314 INFO L290 TraceCheckUtils]: 118: Hoare triple {47242#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {47242#false} is VALID [2022-04-27 15:37:17,314 INFO L290 TraceCheckUtils]: 119: Hoare triple {47242#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); {47242#false} is VALID [2022-04-27 15:37:17,314 INFO L290 TraceCheckUtils]: 120: Hoare triple {47242#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {47242#false} is VALID [2022-04-27 15:37:17,314 INFO L290 TraceCheckUtils]: 121: Hoare triple {47242#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); {47242#false} is VALID [2022-04-27 15:37:17,314 INFO L290 TraceCheckUtils]: 122: Hoare triple {47242#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; {47242#false} is VALID [2022-04-27 15:37:17,314 INFO L290 TraceCheckUtils]: 123: Hoare triple {47242#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; {47242#false} is VALID [2022-04-27 15:37:17,314 INFO L290 TraceCheckUtils]: 124: Hoare triple {47242#false} assume 7 == ~blastFlag~0; {47242#false} is VALID [2022-04-27 15:37:17,314 INFO L290 TraceCheckUtils]: 125: Hoare triple {47242#false} assume !false; {47242#false} is VALID [2022-04-27 15:37:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-27 15:37:17,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:37:17,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270024195] [2022-04-27 15:37:17,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270024195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:37:17,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:37:17,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:37:17,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790203777] [2022-04-27 15:37:17,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:37:17,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 126 [2022-04-27 15:37:17,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:37:17,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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:37:17,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:17,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:37:17,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:37:17,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:37:17,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:37:17,378 INFO L87 Difference]: Start difference. First operand 420 states and 634 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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:37:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:22,694 INFO L93 Difference]: Finished difference Result 836 states and 1268 transitions. [2022-04-27 15:37:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:37:22,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 126 [2022-04-27 15:37:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:37:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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:37:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-27 15:37:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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:37:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-27 15:37:22,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-27 15:37:22,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:22,984 INFO L225 Difference]: With dead ends: 836 [2022-04-27 15:37:22,984 INFO L226 Difference]: Without dead ends: 442 [2022-04-27 15:37:22,985 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:37:22,985 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 46 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:37:22,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 603 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 15:37:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-04-27 15:37:22,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 420. [2022-04-27 15:37:22,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:37:22,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 442 states. Second operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 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:37:22,991 INFO L74 IsIncluded]: Start isIncluded. First operand 442 states. Second operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 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:37:22,991 INFO L87 Difference]: Start difference. First operand 442 states. Second operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 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:37:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:22,998 INFO L93 Difference]: Finished difference Result 442 states and 663 transitions. [2022-04-27 15:37:22,998 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 663 transitions. [2022-04-27 15:37:22,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:22,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:22,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 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 442 states. [2022-04-27 15:37:22,999 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 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 442 states. [2022-04-27 15:37:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:23,007 INFO L93 Difference]: Finished difference Result 442 states and 663 transitions. [2022-04-27 15:37:23,007 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 663 transitions. [2022-04-27 15:37:23,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:23,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:23,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:37:23,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:37:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 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:37:23,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 633 transitions. [2022-04-27 15:37:23,015 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 633 transitions. Word has length 126 [2022-04-27 15:37:23,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:37:23,015 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 633 transitions. [2022-04-27 15:37:23,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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:37:23,015 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 633 transitions. [2022-04-27 15:37:23,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-27 15:37:23,016 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:37:23,016 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:37:23,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-27 15:37:23,016 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:37:23,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:37:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1245189615, now seen corresponding path program 1 times [2022-04-27 15:37:23,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:37:23,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711587849] [2022-04-27 15:37:23,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:37:23,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:37:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:23,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:37:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:23,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {49541#(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); {49534#true} is VALID [2022-04-27 15:37:23,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {49534#true} assume true; {49534#true} is VALID [2022-04-27 15:37:23,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49534#true} {49534#true} #690#return; {49534#true} is VALID [2022-04-27 15:37:23,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {49534#true} call ULTIMATE.init(); {49541#(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:37:23,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {49541#(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); {49534#true} is VALID [2022-04-27 15:37:23,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {49534#true} assume true; {49534#true} is VALID [2022-04-27 15:37:23,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49534#true} {49534#true} #690#return; {49534#true} is VALID [2022-04-27 15:37:23,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {49534#true} call #t~ret161 := main(); {49534#true} is VALID [2022-04-27 15:37:23,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {49534#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; {49534#true} is VALID [2022-04-27 15:37:23,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {49534#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,119 INFO L272 TraceCheckUtils]: 7: Hoare triple {49534#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {49534#true} is VALID [2022-04-27 15:37:23,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {49534#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); {49534#true} is VALID [2022-04-27 15:37:23,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {49534#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; {49534#true} is VALID [2022-04-27 15:37:23,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {49534#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; {49534#true} is VALID [2022-04-27 15:37:23,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {49534#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {49534#true} is VALID [2022-04-27 15:37:23,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {49534#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {49534#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {49534#true} assume !false; {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {49534#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); {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {49534#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {49534#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {49534#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {49534#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {49534#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {49534#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {49534#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {49534#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {49534#true} assume 8464 == #t~mem55;havoc #t~mem55; {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {49534#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; {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {49534#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {49534#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); {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {49534#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); {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {49534#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {49534#true} ~skip~0 := 0; {49534#true} is VALID [2022-04-27 15:37:23,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {49534#true} assume !false; {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 32: Hoare triple {49534#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); {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 33: Hoare triple {49534#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {49534#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {49534#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {49534#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {49534#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {49534#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {49534#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {49534#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {49534#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {49534#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {49534#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {49534#true} assume 8496 == #t~mem58;havoc #t~mem58; {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {49534#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {49534#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {49534#true} is VALID [2022-04-27 15:37:23,121 INFO L290 TraceCheckUtils]: 47: Hoare triple {49534#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {49534#true} is VALID [2022-04-27 15:37:23,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {49534#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {49539#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:23,123 INFO L290 TraceCheckUtils]: 49: Hoare triple {49539#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {49539#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:23,123 INFO L290 TraceCheckUtils]: 50: Hoare triple {49539#(not (= 8195 (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); {49539#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:23,123 INFO L290 TraceCheckUtils]: 51: Hoare triple {49539#(not (= 8195 (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; {49539#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:23,124 INFO L290 TraceCheckUtils]: 52: Hoare triple {49539#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {49539#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:23,124 INFO L290 TraceCheckUtils]: 53: Hoare triple {49539#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {49539#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:23,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {49539#(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); {49539#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:23,124 INFO L290 TraceCheckUtils]: 55: Hoare triple {49539#(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); {49539#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:23,125 INFO L290 TraceCheckUtils]: 56: Hoare triple {49539#(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); {49539#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:23,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {49539#(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); {49539#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:23,125 INFO L290 TraceCheckUtils]: 58: Hoare triple {49539#(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); {49540#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 59: Hoare triple {49540#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {49535#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 61: Hoare triple {49535#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 62: Hoare triple {49535#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 63: Hoare triple {49535#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); {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 64: Hoare triple {49535#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 65: Hoare triple {49535#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); {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 66: Hoare triple {49535#false} assume 12292 != #t~mem85;havoc #t~mem85; {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 67: Hoare triple {49535#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; {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 68: Hoare triple {49535#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); {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 69: Hoare triple {49535#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 70: Hoare triple {49535#false} ~skip~0 := 0; {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 71: Hoare triple {49535#false} assume !false; {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 72: Hoare triple {49535#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); {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 73: Hoare triple {49535#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 74: Hoare triple {49535#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,126 INFO L290 TraceCheckUtils]: 75: Hoare triple {49535#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 76: Hoare triple {49535#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 77: Hoare triple {49535#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 78: Hoare triple {49535#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 79: Hoare triple {49535#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 80: Hoare triple {49535#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 81: Hoare triple {49535#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 82: Hoare triple {49535#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 83: Hoare triple {49535#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 84: Hoare triple {49535#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 85: Hoare triple {49535#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 86: Hoare triple {49535#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 87: Hoare triple {49535#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 88: Hoare triple {49535#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 89: Hoare triple {49535#false} assume 8529 == #t~mem63;havoc #t~mem63; {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 90: Hoare triple {49535#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); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 91: Hoare triple {49535#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; {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 92: Hoare triple {49535#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); {49535#false} is VALID [2022-04-27 15:37:23,127 INFO L290 TraceCheckUtils]: 93: Hoare triple {49535#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 94: Hoare triple {49535#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 95: Hoare triple {49535#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 96: Hoare triple {49535#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 97: Hoare triple {49535#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); {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 98: Hoare triple {49535#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 99: Hoare triple {49535#false} ~skip~0 := 0; {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 100: Hoare triple {49535#false} assume !false; {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 101: Hoare triple {49535#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); {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 102: Hoare triple {49535#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 103: Hoare triple {49535#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 104: Hoare triple {49535#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 105: Hoare triple {49535#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 106: Hoare triple {49535#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 107: Hoare triple {49535#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 108: Hoare triple {49535#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 109: Hoare triple {49535#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 110: Hoare triple {49535#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,128 INFO L290 TraceCheckUtils]: 111: Hoare triple {49535#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 112: Hoare triple {49535#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 113: Hoare triple {49535#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 114: Hoare triple {49535#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 115: Hoare triple {49535#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 116: Hoare triple {49535#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 117: Hoare triple {49535#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 118: Hoare triple {49535#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 119: Hoare triple {49535#false} assume 8544 == #t~mem64;havoc #t~mem64; {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 120: Hoare triple {49535#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 121: Hoare triple {49535#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); {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 122: Hoare triple {49535#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 123: Hoare triple {49535#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); {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 124: Hoare triple {49535#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; {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 125: Hoare triple {49535#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; {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 126: Hoare triple {49535#false} assume 7 == ~blastFlag~0; {49535#false} is VALID [2022-04-27 15:37:23,129 INFO L290 TraceCheckUtils]: 127: Hoare triple {49535#false} assume !false; {49535#false} is VALID [2022-04-27 15:37:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-27 15:37:23,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:37:23,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711587849] [2022-04-27 15:37:23,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711587849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:37:23,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:37:23,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:37:23,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682626055] [2022-04-27 15:37:23,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:37:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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 128 [2022-04-27 15:37:23,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:37:23,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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:37:23,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:23,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:37:23,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:37:23,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:37:23,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:37:23,198 INFO L87 Difference]: Start difference. First operand 420 states and 633 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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:37:27,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:37:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:31,181 INFO L93 Difference]: Finished difference Result 891 states and 1345 transitions. [2022-04-27 15:37:31,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:37:31,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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 128 [2022-04-27 15:37:31,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:37:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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:37:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-27 15:37:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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:37:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-27 15:37:31,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 587 transitions. [2022-04-27 15:37:31,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 587 edges. 587 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:31,544 INFO L225 Difference]: With dead ends: 891 [2022-04-27 15:37:31,544 INFO L226 Difference]: Without dead ends: 497 [2022-04-27 15:37:31,544 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:37:31,545 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 141 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:37:31,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 346 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-27 15:37:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-27 15:37:31,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 420. [2022-04-27 15:37:31,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:37:31,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 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:37:31,551 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 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:37:31,551 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 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:37:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:31,559 INFO L93 Difference]: Finished difference Result 497 states and 734 transitions. [2022-04-27 15:37:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 734 transitions. [2022-04-27 15:37:31,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:31,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:31,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 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 497 states. [2022-04-27 15:37:31,561 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 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 497 states. [2022-04-27 15:37:31,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:31,569 INFO L93 Difference]: Finished difference Result 497 states and 734 transitions. [2022-04-27 15:37:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 734 transitions. [2022-04-27 15:37:31,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:31,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:31,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:37:31,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:37:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 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:37:31,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 625 transitions. [2022-04-27 15:37:31,576 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 625 transitions. Word has length 128 [2022-04-27 15:37:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:37:31,577 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 625 transitions. [2022-04-27 15:37:31,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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:37:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 625 transitions. [2022-04-27 15:37:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:37:31,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:37:31,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:31,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-27 15:37:31,578 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:37:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:37:31,578 INFO L85 PathProgramCache]: Analyzing trace with hash -881988740, now seen corresponding path program 1 times [2022-04-27 15:37:31,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:37:31,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303381695] [2022-04-27 15:37:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:37:31,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:37:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:31,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:37:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:31,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {52014#(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); {52007#true} is VALID [2022-04-27 15:37:31,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {52007#true} assume true; {52007#true} is VALID [2022-04-27 15:37:31,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52007#true} {52007#true} #690#return; {52007#true} is VALID [2022-04-27 15:37:31,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {52007#true} call ULTIMATE.init(); {52014#(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:37:31,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {52014#(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); {52007#true} is VALID [2022-04-27 15:37:31,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {52007#true} assume true; {52007#true} is VALID [2022-04-27 15:37:31,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52007#true} {52007#true} #690#return; {52007#true} is VALID [2022-04-27 15:37:31,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {52007#true} call #t~ret161 := main(); {52007#true} is VALID [2022-04-27 15:37:31,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {52007#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; {52007#true} is VALID [2022-04-27 15:37:31,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {52007#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,676 INFO L272 TraceCheckUtils]: 7: Hoare triple {52007#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {52007#true} is VALID [2022-04-27 15:37:31,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {52007#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); {52007#true} is VALID [2022-04-27 15:37:31,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {52007#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; {52007#true} is VALID [2022-04-27 15:37:31,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {52007#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; {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {52007#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {52007#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {52007#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {52007#true} assume !false; {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {52007#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); {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {52007#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {52007#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {52007#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {52007#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {52007#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {52007#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {52007#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {52007#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {52007#true} assume 8464 == #t~mem55;havoc #t~mem55; {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {52007#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; {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {52007#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52007#true} is VALID [2022-04-27 15:37:31,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {52007#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); {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {52007#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); {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {52007#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {52007#true} ~skip~0 := 0; {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {52007#true} assume !false; {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {52007#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); {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {52007#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {52007#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {52007#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {52007#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {52007#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {52007#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {52007#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {52007#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {52007#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {52007#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 43: Hoare triple {52007#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 44: Hoare triple {52007#true} assume 8496 == #t~mem58;havoc #t~mem58; {52007#true} is VALID [2022-04-27 15:37:31,678 INFO L290 TraceCheckUtils]: 45: Hoare triple {52007#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {52007#true} is VALID [2022-04-27 15:37:31,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {52007#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52007#true} is VALID [2022-04-27 15:37:31,679 INFO L290 TraceCheckUtils]: 47: Hoare triple {52007#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {52007#true} is VALID [2022-04-27 15:37:31,679 INFO L290 TraceCheckUtils]: 48: Hoare triple {52007#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,680 INFO L290 TraceCheckUtils]: 49: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,680 INFO L290 TraceCheckUtils]: 50: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {52012#(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; {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,681 INFO L290 TraceCheckUtils]: 52: Hoare triple {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} ~skip~0 := 0; {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,681 INFO L290 TraceCheckUtils]: 53: Hoare triple {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !false; {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,681 INFO L290 TraceCheckUtils]: 54: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,682 INFO L290 TraceCheckUtils]: 55: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,682 INFO L290 TraceCheckUtils]: 56: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,682 INFO L290 TraceCheckUtils]: 57: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,682 INFO L290 TraceCheckUtils]: 58: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,683 INFO L290 TraceCheckUtils]: 59: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,683 INFO L290 TraceCheckUtils]: 60: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,683 INFO L290 TraceCheckUtils]: 61: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,684 INFO L290 TraceCheckUtils]: 62: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,684 INFO L290 TraceCheckUtils]: 63: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,684 INFO L290 TraceCheckUtils]: 64: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,685 INFO L290 TraceCheckUtils]: 65: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {52012#(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); {52012#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-27 15:37:31,685 INFO L290 TraceCheckUtils]: 67: Hoare triple {52012#(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); {52013#(not (= |ssl3_accept_#t~mem60| 8512))} is VALID [2022-04-27 15:37:31,685 INFO L290 TraceCheckUtils]: 68: Hoare triple {52013#(not (= |ssl3_accept_#t~mem60| 8512))} assume 8512 == #t~mem60;havoc #t~mem60; {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 69: Hoare triple {52008#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); {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 70: Hoare triple {52008#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; {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 71: Hoare triple {52008#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 72: Hoare triple {52008#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); {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 73: Hoare triple {52008#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 74: Hoare triple {52008#false} ~skip~0 := 0; {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 75: Hoare triple {52008#false} assume !false; {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 76: Hoare triple {52008#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); {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 77: Hoare triple {52008#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 78: Hoare triple {52008#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 79: Hoare triple {52008#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 80: Hoare triple {52008#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 81: Hoare triple {52008#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 82: Hoare triple {52008#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 83: Hoare triple {52008#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 84: Hoare triple {52008#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,686 INFO L290 TraceCheckUtils]: 85: Hoare triple {52008#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 86: Hoare triple {52008#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 87: Hoare triple {52008#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 88: Hoare triple {52008#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 89: Hoare triple {52008#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 90: Hoare triple {52008#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 91: Hoare triple {52008#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 92: Hoare triple {52008#false} assume 8528 == #t~mem62;havoc #t~mem62; {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 93: Hoare triple {52008#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); {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 94: Hoare triple {52008#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; {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 95: Hoare triple {52008#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); {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 96: Hoare triple {52008#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 97: Hoare triple {52008#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 98: Hoare triple {52008#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 99: Hoare triple {52008#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 100: Hoare triple {52008#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); {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 101: Hoare triple {52008#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 102: Hoare triple {52008#false} ~skip~0 := 0; {52008#false} is VALID [2022-04-27 15:37:31,687 INFO L290 TraceCheckUtils]: 103: Hoare triple {52008#false} assume !false; {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 104: Hoare triple {52008#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); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 105: Hoare triple {52008#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 106: Hoare triple {52008#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 107: Hoare triple {52008#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 108: Hoare triple {52008#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 109: Hoare triple {52008#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 110: Hoare triple {52008#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 111: Hoare triple {52008#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 112: Hoare triple {52008#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 113: Hoare triple {52008#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 114: Hoare triple {52008#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 115: Hoare triple {52008#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 116: Hoare triple {52008#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 117: Hoare triple {52008#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 118: Hoare triple {52008#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 119: Hoare triple {52008#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 120: Hoare triple {52008#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,688 INFO L290 TraceCheckUtils]: 121: Hoare triple {52008#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,689 INFO L290 TraceCheckUtils]: 122: Hoare triple {52008#false} assume 8544 == #t~mem64;havoc #t~mem64; {52008#false} is VALID [2022-04-27 15:37:31,689 INFO L290 TraceCheckUtils]: 123: Hoare triple {52008#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {52008#false} is VALID [2022-04-27 15:37:31,689 INFO L290 TraceCheckUtils]: 124: Hoare triple {52008#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); {52008#false} is VALID [2022-04-27 15:37:31,689 INFO L290 TraceCheckUtils]: 125: Hoare triple {52008#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {52008#false} is VALID [2022-04-27 15:37:31,689 INFO L290 TraceCheckUtils]: 126: Hoare triple {52008#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); {52008#false} is VALID [2022-04-27 15:37:31,689 INFO L290 TraceCheckUtils]: 127: Hoare triple {52008#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; {52008#false} is VALID [2022-04-27 15:37:31,689 INFO L290 TraceCheckUtils]: 128: Hoare triple {52008#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; {52008#false} is VALID [2022-04-27 15:37:31,689 INFO L290 TraceCheckUtils]: 129: Hoare triple {52008#false} assume 7 == ~blastFlag~0; {52008#false} is VALID [2022-04-27 15:37:31,689 INFO L290 TraceCheckUtils]: 130: Hoare triple {52008#false} assume !false; {52008#false} is VALID [2022-04-27 15:37:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-27 15:37:31,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:37:31,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303381695] [2022-04-27 15:37:31,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303381695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:37:31,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:37:31,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:37:31,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830735167] [2022-04-27 15:37:31,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:37:31,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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:37:31,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:37:31,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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:37:31,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:31,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:37:31,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:37:31,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:37:31,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:37:31,749 INFO L87 Difference]: Start difference. First operand 420 states and 625 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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:37:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:36,137 INFO L93 Difference]: Finished difference Result 891 states and 1329 transitions. [2022-04-27 15:37:36,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:37:36,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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:37:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:37:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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:37:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-27 15:37:36,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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:37:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-27 15:37:36,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 587 transitions. [2022-04-27 15:37:36,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 587 edges. 587 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:36,508 INFO L225 Difference]: With dead ends: 891 [2022-04-27 15:37:36,508 INFO L226 Difference]: Without dead ends: 497 [2022-04-27 15:37:36,509 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:37:36,509 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 131 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:37:36,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 360 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-27 15:37:36,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-27 15:37:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 420. [2022-04-27 15:37:36,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:37:36,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.4819277108433735) internal successors, (615), 415 states have internal predecessors, (615), 3 states have call successors, (3), 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:37:36,516 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.4819277108433735) internal successors, (615), 415 states have internal predecessors, (615), 3 states have call successors, (3), 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:37:36,516 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.4819277108433735) internal successors, (615), 415 states have internal predecessors, (615), 3 states have call successors, (3), 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:37:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:36,524 INFO L93 Difference]: Finished difference Result 497 states and 728 transitions. [2022-04-27 15:37:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 728 transitions. [2022-04-27 15:37:36,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:36,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:36,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.4819277108433735) internal successors, (615), 415 states have internal predecessors, (615), 3 states have call successors, (3), 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 497 states. [2022-04-27 15:37:36,526 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.4819277108433735) internal successors, (615), 415 states have internal predecessors, (615), 3 states have call successors, (3), 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 497 states. [2022-04-27 15:37:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:36,534 INFO L93 Difference]: Finished difference Result 497 states and 728 transitions. [2022-04-27 15:37:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 728 transitions. [2022-04-27 15:37:36,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:36,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:36,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:37:36,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:37:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.4819277108433735) internal successors, (615), 415 states have internal predecessors, (615), 3 states have call successors, (3), 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:37:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 619 transitions. [2022-04-27 15:37:36,542 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 619 transitions. Word has length 131 [2022-04-27 15:37:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:37:36,543 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 619 transitions. [2022-04-27 15:37:36,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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:37:36,543 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 619 transitions. [2022-04-27 15:37:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:37:36,543 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:37:36,543 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:37:36,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-27 15:37:36,544 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:37:36,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:37:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1134050048, now seen corresponding path program 1 times [2022-04-27 15:37:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:37:36,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281367761] [2022-04-27 15:37:36,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:37:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:37:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:36,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:37:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:36,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {54487#(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); {54480#true} is VALID [2022-04-27 15:37:36,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {54480#true} assume true; {54480#true} is VALID [2022-04-27 15:37:36,645 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54480#true} {54480#true} #690#return; {54480#true} is VALID [2022-04-27 15:37:36,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {54480#true} call ULTIMATE.init(); {54487#(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:37:36,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {54487#(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); {54480#true} is VALID [2022-04-27 15:37:36,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {54480#true} assume true; {54480#true} is VALID [2022-04-27 15:37:36,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54480#true} {54480#true} #690#return; {54480#true} is VALID [2022-04-27 15:37:36,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {54480#true} call #t~ret161 := main(); {54480#true} is VALID [2022-04-27 15:37:36,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {54480#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; {54480#true} is VALID [2022-04-27 15:37:36,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {54480#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L272 TraceCheckUtils]: 7: Hoare triple {54480#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {54480#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); {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {54480#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; {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {54480#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; {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {54480#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {54480#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {54480#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {54480#true} assume !false; {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {54480#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); {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {54480#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {54480#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {54480#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {54480#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {54480#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {54480#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {54480#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {54480#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {54480#true} assume 8464 == #t~mem55;havoc #t~mem55; {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {54480#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; {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {54480#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {54480#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); {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 28: Hoare triple {54480#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); {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {54480#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {54480#true} ~skip~0 := 0; {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {54480#true} assume !false; {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {54480#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); {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {54480#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {54480#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {54480#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {54480#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {54480#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {54480#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {54480#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {54480#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {54480#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {54480#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {54480#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {54480#true} assume 8496 == #t~mem58;havoc #t~mem58; {54480#true} is VALID [2022-04-27 15:37:36,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {54480#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {54480#true} is VALID [2022-04-27 15:37:36,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {54480#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {54480#true} is VALID [2022-04-27 15:37:36,649 INFO L290 TraceCheckUtils]: 47: Hoare triple {54480#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {54480#true} is VALID [2022-04-27 15:37:36,649 INFO L290 TraceCheckUtils]: 48: Hoare triple {54480#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,650 INFO L290 TraceCheckUtils]: 49: Hoare triple {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,650 INFO L290 TraceCheckUtils]: 50: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,651 INFO L290 TraceCheckUtils]: 51: Hoare triple {54485#(not (= 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; {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,651 INFO L290 TraceCheckUtils]: 52: Hoare triple {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,652 INFO L290 TraceCheckUtils]: 54: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,652 INFO L290 TraceCheckUtils]: 55: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,652 INFO L290 TraceCheckUtils]: 56: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,653 INFO L290 TraceCheckUtils]: 57: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,653 INFO L290 TraceCheckUtils]: 58: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,653 INFO L290 TraceCheckUtils]: 59: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,654 INFO L290 TraceCheckUtils]: 60: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,654 INFO L290 TraceCheckUtils]: 61: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,654 INFO L290 TraceCheckUtils]: 62: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,654 INFO L290 TraceCheckUtils]: 63: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,655 INFO L290 TraceCheckUtils]: 64: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,655 INFO L290 TraceCheckUtils]: 65: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,655 INFO L290 TraceCheckUtils]: 66: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,656 INFO L290 TraceCheckUtils]: 67: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,656 INFO L290 TraceCheckUtils]: 68: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,656 INFO L290 TraceCheckUtils]: 69: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,657 INFO L290 TraceCheckUtils]: 70: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,657 INFO L290 TraceCheckUtils]: 71: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,657 INFO L290 TraceCheckUtils]: 72: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,658 INFO L290 TraceCheckUtils]: 73: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,658 INFO L290 TraceCheckUtils]: 74: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,658 INFO L290 TraceCheckUtils]: 75: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,659 INFO L290 TraceCheckUtils]: 76: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,659 INFO L290 TraceCheckUtils]: 77: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,659 INFO L290 TraceCheckUtils]: 78: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,660 INFO L290 TraceCheckUtils]: 79: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,660 INFO L290 TraceCheckUtils]: 80: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,660 INFO L290 TraceCheckUtils]: 81: Hoare triple {54485#(not (= 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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,661 INFO L290 TraceCheckUtils]: 82: Hoare triple {54485#(not (= 8672 (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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,661 INFO L290 TraceCheckUtils]: 83: Hoare triple {54485#(not (= 8672 (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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,661 INFO L290 TraceCheckUtils]: 84: Hoare triple {54485#(not (= 8672 (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); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,661 INFO L290 TraceCheckUtils]: 85: Hoare triple {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:37:36,662 INFO L290 TraceCheckUtils]: 86: Hoare triple {54485#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {54486#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-27 15:37:36,662 INFO L290 TraceCheckUtils]: 87: Hoare triple {54486#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {54481#false} is VALID [2022-04-27 15:37:36,662 INFO L290 TraceCheckUtils]: 88: Hoare triple {54481#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {54481#false} is VALID [2022-04-27 15:37:36,662 INFO L290 TraceCheckUtils]: 89: Hoare triple {54481#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {54481#false} is VALID [2022-04-27 15:37:36,662 INFO L290 TraceCheckUtils]: 90: Hoare triple {54481#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); {54481#false} is VALID [2022-04-27 15:37:36,662 INFO L290 TraceCheckUtils]: 91: Hoare triple {54481#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; {54481#false} is VALID [2022-04-27 15:37:36,662 INFO L290 TraceCheckUtils]: 92: Hoare triple {54481#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,662 INFO L290 TraceCheckUtils]: 93: Hoare triple {54481#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); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 94: Hoare triple {54481#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 95: Hoare triple {54481#false} ~skip~0 := 0; {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 96: Hoare triple {54481#false} assume !false; {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 97: Hoare triple {54481#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); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 98: Hoare triple {54481#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 99: Hoare triple {54481#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 100: Hoare triple {54481#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 101: Hoare triple {54481#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 102: Hoare triple {54481#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 103: Hoare triple {54481#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 104: Hoare triple {54481#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 105: Hoare triple {54481#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 106: Hoare triple {54481#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 107: Hoare triple {54481#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 108: Hoare triple {54481#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 109: Hoare triple {54481#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 110: Hoare triple {54481#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,663 INFO L290 TraceCheckUtils]: 111: Hoare triple {54481#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 112: Hoare triple {54481#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 113: Hoare triple {54481#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 114: Hoare triple {54481#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 115: Hoare triple {54481#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 116: Hoare triple {54481#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 117: Hoare triple {54481#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 118: Hoare triple {54481#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 119: Hoare triple {54481#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 120: Hoare triple {54481#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 121: Hoare triple {54481#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 122: Hoare triple {54481#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 123: Hoare triple {54481#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 124: Hoare triple {54481#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 125: Hoare triple {54481#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 126: Hoare triple {54481#false} assume 8640 == #t~mem75;havoc #t~mem75; {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 127: Hoare triple {54481#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {54481#false} is VALID [2022-04-27 15:37:36,664 INFO L290 TraceCheckUtils]: 128: Hoare triple {54481#false} assume !(4 == ~blastFlag~0); {54481#false} is VALID [2022-04-27 15:37:36,665 INFO L290 TraceCheckUtils]: 129: Hoare triple {54481#false} assume 5 == ~blastFlag~0; {54481#false} is VALID [2022-04-27 15:37:36,665 INFO L290 TraceCheckUtils]: 130: Hoare triple {54481#false} assume !false; {54481#false} is VALID [2022-04-27 15:37:36,665 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:37:36,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:37:36,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281367761] [2022-04-27 15:37:36,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281367761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:37:36,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:37:36,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:37:36,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134325648] [2022-04-27 15:37:36,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:37:36,666 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:37:36,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:37:36,666 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:37:36,736 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:37:36,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:37:36,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:37:36,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:37:36,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:37:36,737 INFO L87 Difference]: Start difference. First operand 420 states and 619 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:37:39,216 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:37:41,157 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:37:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:44,078 INFO L93 Difference]: Finished difference Result 931 states and 1377 transitions. [2022-04-27 15:37:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:37:44,078 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:37:44,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:37:44,078 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:37:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-27 15:37:44,080 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:37:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-27 15:37:44,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-27 15:37:44,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:44,440 INFO L225 Difference]: With dead ends: 931 [2022-04-27 15:37:44,440 INFO L226 Difference]: Without dead ends: 537 [2022-04-27 15:37:44,441 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:37:44,441 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 111 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:37:44,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 347 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-27 15:37:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-04-27 15:37:44,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 463. [2022-04-27 15:37:44,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:37:44,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 537 states. Second operand has 463 states, 458 states have (on average 1.48471615720524) internal successors, (680), 458 states have internal predecessors, (680), 3 states have call successors, (3), 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:37:44,448 INFO L74 IsIncluded]: Start isIncluded. First operand 537 states. Second operand has 463 states, 458 states have (on average 1.48471615720524) internal successors, (680), 458 states have internal predecessors, (680), 3 states have call successors, (3), 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:37:44,448 INFO L87 Difference]: Start difference. First operand 537 states. Second operand has 463 states, 458 states have (on average 1.48471615720524) internal successors, (680), 458 states have internal predecessors, (680), 3 states have call successors, (3), 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:37:44,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:44,457 INFO L93 Difference]: Finished difference Result 537 states and 787 transitions. [2022-04-27 15:37:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 787 transitions. [2022-04-27 15:37:44,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:44,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:44,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 463 states, 458 states have (on average 1.48471615720524) internal successors, (680), 458 states have internal predecessors, (680), 3 states have call successors, (3), 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 537 states. [2022-04-27 15:37:44,459 INFO L87 Difference]: Start difference. First operand has 463 states, 458 states have (on average 1.48471615720524) internal successors, (680), 458 states have internal predecessors, (680), 3 states have call successors, (3), 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 537 states. [2022-04-27 15:37:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:44,468 INFO L93 Difference]: Finished difference Result 537 states and 787 transitions. [2022-04-27 15:37:44,469 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 787 transitions. [2022-04-27 15:37:44,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:44,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:44,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:37:44,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:37:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 458 states have (on average 1.48471615720524) internal successors, (680), 458 states have internal predecessors, (680), 3 states have call successors, (3), 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:37:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 684 transitions. [2022-04-27 15:37:44,477 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 684 transitions. Word has length 131 [2022-04-27 15:37:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:37:44,478 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 684 transitions. [2022-04-27 15:37:44,478 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:37:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 684 transitions. [2022-04-27 15:37:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:37:44,478 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:37:44,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:44,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-27 15:37:44,479 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:37:44,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:37:44,479 INFO L85 PathProgramCache]: Analyzing trace with hash 442867454, now seen corresponding path program 1 times [2022-04-27 15:37:44,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:37:44,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514109656] [2022-04-27 15:37:44,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:37:44,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:37:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:44,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:37:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:44,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {57126#(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); {57120#true} is VALID [2022-04-27 15:37:44,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {57120#true} assume true; {57120#true} is VALID [2022-04-27 15:37:44,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57120#true} {57120#true} #690#return; {57120#true} is VALID [2022-04-27 15:37:44,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {57120#true} call ULTIMATE.init(); {57126#(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:37:44,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {57126#(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); {57120#true} is VALID [2022-04-27 15:37:44,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {57120#true} assume true; {57120#true} is VALID [2022-04-27 15:37:44,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57120#true} {57120#true} #690#return; {57120#true} is VALID [2022-04-27 15:37:44,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {57120#true} call #t~ret161 := main(); {57120#true} is VALID [2022-04-27 15:37:44,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {57120#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; {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {57120#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L272 TraceCheckUtils]: 7: Hoare triple {57120#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {57120#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); {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {57120#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; {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {57120#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; {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {57120#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {57120#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {57120#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {57120#true} assume !false; {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {57120#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); {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {57120#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {57120#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {57120#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {57120#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {57120#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {57120#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {57120#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {57120#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {57120#true} assume 8464 == #t~mem55;havoc #t~mem55; {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {57120#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; {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {57120#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {57120#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); {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {57120#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); {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {57120#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {57120#true} ~skip~0 := 0; {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {57120#true} assume !false; {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {57120#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); {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {57120#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {57120#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {57120#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {57120#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {57120#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {57120#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {57120#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {57120#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {57120#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {57120#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {57120#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {57120#true} is VALID [2022-04-27 15:37:44,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {57120#true} assume 8496 == #t~mem58;havoc #t~mem58; {57120#true} is VALID [2022-04-27 15:37:44,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {57120#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {57120#true} is VALID [2022-04-27 15:37:44,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {57120#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,598 INFO L290 TraceCheckUtils]: 48: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {57125#(= 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); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,598 INFO L290 TraceCheckUtils]: 51: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,599 INFO L290 TraceCheckUtils]: 54: Hoare triple {57125#(= 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); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,600 INFO L290 TraceCheckUtils]: 57: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,600 INFO L290 TraceCheckUtils]: 58: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,600 INFO L290 TraceCheckUtils]: 59: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,601 INFO L290 TraceCheckUtils]: 65: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,601 INFO L290 TraceCheckUtils]: 66: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,602 INFO L290 TraceCheckUtils]: 67: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,602 INFO L290 TraceCheckUtils]: 68: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,602 INFO L290 TraceCheckUtils]: 69: Hoare triple {57125#(= 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); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,602 INFO L290 TraceCheckUtils]: 70: Hoare triple {57125#(= 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; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,603 INFO L290 TraceCheckUtils]: 71: Hoare triple {57125#(= 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); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,603 INFO L290 TraceCheckUtils]: 72: Hoare triple {57125#(= 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); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,603 INFO L290 TraceCheckUtils]: 73: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,603 INFO L290 TraceCheckUtils]: 74: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,604 INFO L290 TraceCheckUtils]: 75: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,604 INFO L290 TraceCheckUtils]: 76: Hoare triple {57125#(= 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); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,604 INFO L290 TraceCheckUtils]: 77: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,604 INFO L290 TraceCheckUtils]: 78: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,604 INFO L290 TraceCheckUtils]: 79: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,605 INFO L290 TraceCheckUtils]: 80: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,605 INFO L290 TraceCheckUtils]: 81: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,605 INFO L290 TraceCheckUtils]: 82: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,605 INFO L290 TraceCheckUtils]: 83: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,605 INFO L290 TraceCheckUtils]: 84: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,606 INFO L290 TraceCheckUtils]: 85: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,606 INFO L290 TraceCheckUtils]: 86: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,606 INFO L290 TraceCheckUtils]: 87: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,606 INFO L290 TraceCheckUtils]: 88: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,607 INFO L290 TraceCheckUtils]: 89: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,607 INFO L290 TraceCheckUtils]: 90: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,607 INFO L290 TraceCheckUtils]: 91: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,607 INFO L290 TraceCheckUtils]: 92: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume 8528 == #t~mem62;havoc #t~mem62; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,608 INFO L290 TraceCheckUtils]: 93: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} 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); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,608 INFO L290 TraceCheckUtils]: 94: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} 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; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,608 INFO L290 TraceCheckUtils]: 95: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} 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); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,608 INFO L290 TraceCheckUtils]: 96: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,608 INFO L290 TraceCheckUtils]: 97: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,609 INFO L290 TraceCheckUtils]: 98: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,609 INFO L290 TraceCheckUtils]: 99: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,609 INFO L290 TraceCheckUtils]: 100: Hoare triple {57125#(= 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); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,609 INFO L290 TraceCheckUtils]: 101: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,609 INFO L290 TraceCheckUtils]: 102: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,610 INFO L290 TraceCheckUtils]: 103: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,610 INFO L290 TraceCheckUtils]: 104: Hoare triple {57125#(= 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); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,610 INFO L290 TraceCheckUtils]: 105: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,610 INFO L290 TraceCheckUtils]: 106: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,611 INFO L290 TraceCheckUtils]: 107: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,611 INFO L290 TraceCheckUtils]: 108: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,611 INFO L290 TraceCheckUtils]: 109: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,611 INFO L290 TraceCheckUtils]: 110: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,611 INFO L290 TraceCheckUtils]: 111: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,612 INFO L290 TraceCheckUtils]: 112: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,612 INFO L290 TraceCheckUtils]: 113: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,612 INFO L290 TraceCheckUtils]: 114: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,612 INFO L290 TraceCheckUtils]: 115: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,613 INFO L290 TraceCheckUtils]: 116: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,613 INFO L290 TraceCheckUtils]: 117: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,613 INFO L290 TraceCheckUtils]: 118: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,613 INFO L290 TraceCheckUtils]: 119: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,613 INFO L290 TraceCheckUtils]: 120: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,614 INFO L290 TraceCheckUtils]: 121: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,614 INFO L290 TraceCheckUtils]: 122: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume 8544 == #t~mem64;havoc #t~mem64; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,614 INFO L290 TraceCheckUtils]: 123: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,614 INFO L290 TraceCheckUtils]: 124: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} 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); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,615 INFO L290 TraceCheckUtils]: 125: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,615 INFO L290 TraceCheckUtils]: 126: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} 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); {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,615 INFO L290 TraceCheckUtils]: 127: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} 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; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,615 INFO L290 TraceCheckUtils]: 128: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} 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; {57125#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:37:44,616 INFO L290 TraceCheckUtils]: 129: Hoare triple {57125#(= 2 ssl3_accept_~blastFlag~0)} assume 7 == ~blastFlag~0; {57121#false} is VALID [2022-04-27 15:37:44,616 INFO L290 TraceCheckUtils]: 130: Hoare triple {57121#false} assume !false; {57121#false} is VALID [2022-04-27 15:37:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-27 15:37:44,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:37:44,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514109656] [2022-04-27 15:37:44,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514109656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:37:44,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:37:44,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:37:44,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312315828] [2022-04-27 15:37:44,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:37:44,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 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:37:44,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:37:44,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 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:37:44,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:44,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:37:44,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:37:44,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:37:44,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:37:44,670 INFO L87 Difference]: Start difference. First operand 463 states and 684 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 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:37:46,500 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:37:48,505 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:37:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:50,314 INFO L93 Difference]: Finished difference Result 1292 states and 1928 transitions. [2022-04-27 15:37:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:37:50,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 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:37:50,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:37:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 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:37:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-27 15:37:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 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:37:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-27 15:37:50,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 603 transitions. [2022-04-27 15:37:50,670 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:37:50,693 INFO L225 Difference]: With dead ends: 1292 [2022-04-27 15:37:50,694 INFO L226 Difference]: Without dead ends: 855 [2022-04-27 15:37:50,694 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:37:50,695 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 136 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:37:50,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 436 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 284 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-04-27 15:37:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-04-27 15:37:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2022-04-27 15:37:50,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:37:50,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 855 states. Second operand has 855 states, 850 states have (on average 1.4823529411764707) internal successors, (1260), 850 states have internal predecessors, (1260), 3 states have call successors, (3), 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:37:50,705 INFO L74 IsIncluded]: Start isIncluded. First operand 855 states. Second operand has 855 states, 850 states have (on average 1.4823529411764707) internal successors, (1260), 850 states have internal predecessors, (1260), 3 states have call successors, (3), 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:37:50,706 INFO L87 Difference]: Start difference. First operand 855 states. Second operand has 855 states, 850 states have (on average 1.4823529411764707) internal successors, (1260), 850 states have internal predecessors, (1260), 3 states have call successors, (3), 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:37:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:50,729 INFO L93 Difference]: Finished difference Result 855 states and 1264 transitions. [2022-04-27 15:37:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1264 transitions. [2022-04-27 15:37:50,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:50,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:50,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 855 states, 850 states have (on average 1.4823529411764707) internal successors, (1260), 850 states have internal predecessors, (1260), 3 states have call successors, (3), 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 855 states. [2022-04-27 15:37:50,731 INFO L87 Difference]: Start difference. First operand has 855 states, 850 states have (on average 1.4823529411764707) internal successors, (1260), 850 states have internal predecessors, (1260), 3 states have call successors, (3), 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 855 states. [2022-04-27 15:37:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:50,753 INFO L93 Difference]: Finished difference Result 855 states and 1264 transitions. [2022-04-27 15:37:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1264 transitions. [2022-04-27 15:37:50,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:50,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:50,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:37:50,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:37:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 850 states have (on average 1.4823529411764707) internal successors, (1260), 850 states have internal predecessors, (1260), 3 states have call successors, (3), 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:37:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1264 transitions. [2022-04-27 15:37:50,778 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1264 transitions. Word has length 131 [2022-04-27 15:37:50,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:37:50,778 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 1264 transitions. [2022-04-27 15:37:50,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 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:37:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1264 transitions. [2022-04-27 15:37:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:37:50,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:37:50,780 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:50,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-27 15:37:50,780 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:37:50,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:37:50,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1975617024, now seen corresponding path program 1 times [2022-04-27 15:37:50,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:37:50,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950653130] [2022-04-27 15:37:50,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:37:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:37:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:50,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:37:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:50,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {61215#(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); {61209#true} is VALID [2022-04-27 15:37:50,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {61209#true} assume true; {61209#true} is VALID [2022-04-27 15:37:50,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61209#true} {61209#true} #690#return; {61209#true} is VALID [2022-04-27 15:37:50,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {61209#true} call ULTIMATE.init(); {61215#(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:37:50,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {61215#(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); {61209#true} is VALID [2022-04-27 15:37:50,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {61209#true} assume true; {61209#true} is VALID [2022-04-27 15:37:50,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61209#true} {61209#true} #690#return; {61209#true} is VALID [2022-04-27 15:37:50,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {61209#true} call #t~ret161 := main(); {61209#true} is VALID [2022-04-27 15:37:50,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {61209#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; {61209#true} is VALID [2022-04-27 15:37:50,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {61209#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {61209#true} is VALID [2022-04-27 15:37:50,869 INFO L272 TraceCheckUtils]: 7: Hoare triple {61209#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {61209#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); {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {61209#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; {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {61209#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; {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {61209#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {61209#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {61209#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {61209#true} assume !false; {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {61209#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); {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {61209#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {61209#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {61209#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {61209#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {61209#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {61209#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {61209#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {61209#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61209#true} is VALID [2022-04-27 15:37:50,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {61209#true} assume 8464 == #t~mem55;havoc #t~mem55; {61209#true} is VALID [2022-04-27 15:37:50,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {61209#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; {61209#true} is VALID [2022-04-27 15:37:50,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {61209#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {61214#(= 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); {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {61214#(= 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); {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume !false; {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {61214#(= 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); {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,874 INFO L290 TraceCheckUtils]: 41: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,874 INFO L290 TraceCheckUtils]: 42: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,875 INFO L290 TraceCheckUtils]: 43: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,875 INFO L290 TraceCheckUtils]: 44: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,875 INFO L290 TraceCheckUtils]: 45: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {61214#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:37:50,875 INFO L290 TraceCheckUtils]: 46: Hoare triple {61214#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {61210#false} is VALID [2022-04-27 15:37:50,875 INFO L290 TraceCheckUtils]: 47: Hoare triple {61210#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,875 INFO L290 TraceCheckUtils]: 48: Hoare triple {61210#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 49: Hoare triple {61210#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 50: Hoare triple {61210#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); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 51: Hoare triple {61210#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {61210#false} ~skip~0 := 0; {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 53: Hoare triple {61210#false} assume !false; {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 54: Hoare triple {61210#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); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 55: Hoare triple {61210#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 56: Hoare triple {61210#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 57: Hoare triple {61210#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 58: Hoare triple {61210#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 59: Hoare triple {61210#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 60: Hoare triple {61210#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 61: Hoare triple {61210#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 62: Hoare triple {61210#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 63: Hoare triple {61210#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 64: Hoare triple {61210#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 65: Hoare triple {61210#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,876 INFO L290 TraceCheckUtils]: 66: Hoare triple {61210#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,877 INFO L290 TraceCheckUtils]: 67: Hoare triple {61210#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,877 INFO L290 TraceCheckUtils]: 68: Hoare triple {61210#false} assume 8512 == #t~mem60;havoc #t~mem60; {61210#false} is VALID [2022-04-27 15:37:50,878 INFO L290 TraceCheckUtils]: 69: Hoare triple {61210#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); {61210#false} is VALID [2022-04-27 15:37:50,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {61210#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; {61210#false} is VALID [2022-04-27 15:37:50,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {61210#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {61210#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); {61210#false} is VALID [2022-04-27 15:37:50,880 INFO L290 TraceCheckUtils]: 73: Hoare triple {61210#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {61210#false} is VALID [2022-04-27 15:37:50,880 INFO L290 TraceCheckUtils]: 74: Hoare triple {61210#false} ~skip~0 := 0; {61210#false} is VALID [2022-04-27 15:37:50,880 INFO L290 TraceCheckUtils]: 75: Hoare triple {61210#false} assume !false; {61210#false} is VALID [2022-04-27 15:37:50,880 INFO L290 TraceCheckUtils]: 76: Hoare triple {61210#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); {61210#false} is VALID [2022-04-27 15:37:50,880 INFO L290 TraceCheckUtils]: 77: Hoare triple {61210#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 78: Hoare triple {61210#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 79: Hoare triple {61210#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 80: Hoare triple {61210#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 81: Hoare triple {61210#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 82: Hoare triple {61210#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 83: Hoare triple {61210#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 84: Hoare triple {61210#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 85: Hoare triple {61210#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 86: Hoare triple {61210#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 87: Hoare triple {61210#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 88: Hoare triple {61210#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 89: Hoare triple {61210#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 90: Hoare triple {61210#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 91: Hoare triple {61210#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 92: Hoare triple {61210#false} assume 8528 == #t~mem62;havoc #t~mem62; {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 93: Hoare triple {61210#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); {61210#false} is VALID [2022-04-27 15:37:50,881 INFO L290 TraceCheckUtils]: 94: Hoare triple {61210#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; {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 95: Hoare triple {61210#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); {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 96: Hoare triple {61210#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 97: Hoare triple {61210#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 98: Hoare triple {61210#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 99: Hoare triple {61210#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 100: Hoare triple {61210#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); {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 101: Hoare triple {61210#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 102: Hoare triple {61210#false} ~skip~0 := 0; {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 103: Hoare triple {61210#false} assume !false; {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 104: Hoare triple {61210#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); {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 105: Hoare triple {61210#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 106: Hoare triple {61210#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 107: Hoare triple {61210#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 108: Hoare triple {61210#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 109: Hoare triple {61210#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 110: Hoare triple {61210#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 111: Hoare triple {61210#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,882 INFO L290 TraceCheckUtils]: 112: Hoare triple {61210#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 113: Hoare triple {61210#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 114: Hoare triple {61210#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 115: Hoare triple {61210#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 116: Hoare triple {61210#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 117: Hoare triple {61210#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 118: Hoare triple {61210#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 119: Hoare triple {61210#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 120: Hoare triple {61210#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 121: Hoare triple {61210#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 122: Hoare triple {61210#false} assume 8544 == #t~mem64;havoc #t~mem64; {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 123: Hoare triple {61210#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 124: Hoare triple {61210#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); {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 125: Hoare triple {61210#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 126: Hoare triple {61210#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); {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 127: Hoare triple {61210#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; {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 128: Hoare triple {61210#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; {61210#false} is VALID [2022-04-27 15:37:50,883 INFO L290 TraceCheckUtils]: 129: Hoare triple {61210#false} assume 7 == ~blastFlag~0; {61210#false} is VALID [2022-04-27 15:37:50,884 INFO L290 TraceCheckUtils]: 130: Hoare triple {61210#false} assume !false; {61210#false} is VALID [2022-04-27 15:37:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-04-27 15:37:50,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:37:50,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950653130] [2022-04-27 15:37:50,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950653130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:37:50,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:37:50,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:37:50,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176625583] [2022-04-27 15:37:50,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:37:50,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 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:37:50,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:37:50,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 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:37:50,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:50,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:37:50,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:37:50,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:37:50,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:37:50,945 INFO L87 Difference]: Start difference. First operand 855 states and 1264 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 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:37:53,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:53,411 INFO L93 Difference]: Finished difference Result 1711 states and 2535 transitions. [2022-04-27 15:37:53,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:37:53,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 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:37:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:37:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 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:37:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-27 15:37:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 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:37:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-27 15:37:53,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 448 transitions. [2022-04-27 15:37:53,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:53,698 INFO L225 Difference]: With dead ends: 1711 [2022-04-27 15:37:53,698 INFO L226 Difference]: Without dead ends: 882 [2022-04-27 15:37:53,699 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:37:53,699 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:37:53,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 417 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 15:37:53,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-04-27 15:37:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2022-04-27 15:37:53,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:37:53,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 882 states. Second operand has 882 states, 877 states have (on average 1.4766248574686431) internal successors, (1295), 877 states have internal predecessors, (1295), 3 states have call successors, (3), 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:37:53,711 INFO L74 IsIncluded]: Start isIncluded. First operand 882 states. Second operand has 882 states, 877 states have (on average 1.4766248574686431) internal successors, (1295), 877 states have internal predecessors, (1295), 3 states have call successors, (3), 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:37:53,711 INFO L87 Difference]: Start difference. First operand 882 states. Second operand has 882 states, 877 states have (on average 1.4766248574686431) internal successors, (1295), 877 states have internal predecessors, (1295), 3 states have call successors, (3), 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:37:53,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:53,734 INFO L93 Difference]: Finished difference Result 882 states and 1299 transitions. [2022-04-27 15:37:53,734 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1299 transitions. [2022-04-27 15:37:53,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:53,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:53,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 882 states, 877 states have (on average 1.4766248574686431) internal successors, (1295), 877 states have internal predecessors, (1295), 3 states have call successors, (3), 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 882 states. [2022-04-27 15:37:53,736 INFO L87 Difference]: Start difference. First operand has 882 states, 877 states have (on average 1.4766248574686431) internal successors, (1295), 877 states have internal predecessors, (1295), 3 states have call successors, (3), 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 882 states. [2022-04-27 15:37:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:53,759 INFO L93 Difference]: Finished difference Result 882 states and 1299 transitions. [2022-04-27 15:37:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1299 transitions. [2022-04-27 15:37:53,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:53,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:53,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:37:53,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:37:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 877 states have (on average 1.4766248574686431) internal successors, (1295), 877 states have internal predecessors, (1295), 3 states have call successors, (3), 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:37:53,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1299 transitions. [2022-04-27 15:37:53,787 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1299 transitions. Word has length 131 [2022-04-27 15:37:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:37:53,787 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 1299 transitions. [2022-04-27 15:37:53,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 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:37:53,787 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1299 transitions. [2022-04-27 15:37:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:37:53,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:37:53,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:53,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-27 15:37:53,788 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:37:53,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:37:53,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1857175550, now seen corresponding path program 1 times [2022-04-27 15:37:53,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:37:53,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583540990] [2022-04-27 15:37:53,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:37:53,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:37:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:53,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:37:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:53,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {65852#(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); {65846#true} is VALID [2022-04-27 15:37:53,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {65846#true} assume true; {65846#true} is VALID [2022-04-27 15:37:53,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65846#true} {65846#true} #690#return; {65846#true} is VALID [2022-04-27 15:37:53,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {65846#true} call ULTIMATE.init(); {65852#(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:37:53,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {65852#(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); {65846#true} is VALID [2022-04-27 15:37:53,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {65846#true} assume true; {65846#true} is VALID [2022-04-27 15:37:53,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65846#true} {65846#true} #690#return; {65846#true} is VALID [2022-04-27 15:37:53,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {65846#true} call #t~ret161 := main(); {65846#true} is VALID [2022-04-27 15:37:53,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {65846#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; {65846#true} is VALID [2022-04-27 15:37:53,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {65846#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {65846#true} is VALID [2022-04-27 15:37:53,891 INFO L272 TraceCheckUtils]: 7: Hoare triple {65846#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {65846#true} is VALID [2022-04-27 15:37:53,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {65846#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); {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {65851#(= 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; {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {65851#(= 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; {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {65851#(= 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)))); {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {65851#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {65851#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {65851#(= ssl3_accept_~blastFlag~0 0)} assume !false; {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {65851#(= 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); {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {65851#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {65851#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {65851#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {65851#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {65851#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {65851#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {65851#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {65851#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {65851#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {65851#(= 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; {65851#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:37:53,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {65851#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {65847#false} is VALID [2022-04-27 15:37:53,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {65847#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); {65847#false} is VALID [2022-04-27 15:37:53,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {65847#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); {65847#false} is VALID [2022-04-27 15:37:53,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {65847#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {65847#false} is VALID [2022-04-27 15:37:53,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {65847#false} ~skip~0 := 0; {65847#false} is VALID [2022-04-27 15:37:53,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {65847#false} assume !false; {65847#false} is VALID [2022-04-27 15:37:53,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {65847#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); {65847#false} is VALID [2022-04-27 15:37:53,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {65847#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {65847#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {65847#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {65847#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {65847#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {65847#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {65847#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {65847#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {65847#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {65847#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {65847#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 44: Hoare triple {65847#false} assume 8496 == #t~mem58;havoc #t~mem58; {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 45: Hoare triple {65847#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {65847#false} assume !(1 == ~blastFlag~0); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 47: Hoare triple {65847#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {65847#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {65847#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 50: Hoare triple {65847#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); {65847#false} is VALID [2022-04-27 15:37:53,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {65847#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 52: Hoare triple {65847#false} ~skip~0 := 0; {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {65847#false} assume !false; {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {65847#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); {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 55: Hoare triple {65847#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 56: Hoare triple {65847#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 57: Hoare triple {65847#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 58: Hoare triple {65847#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 59: Hoare triple {65847#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 60: Hoare triple {65847#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 61: Hoare triple {65847#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 62: Hoare triple {65847#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 63: Hoare triple {65847#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 64: Hoare triple {65847#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 65: Hoare triple {65847#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 66: Hoare triple {65847#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 67: Hoare triple {65847#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 68: Hoare triple {65847#false} assume 8512 == #t~mem60;havoc #t~mem60; {65847#false} is VALID [2022-04-27 15:37:53,898 INFO L290 TraceCheckUtils]: 69: Hoare triple {65847#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); {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 70: Hoare triple {65847#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; {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 71: Hoare triple {65847#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 72: Hoare triple {65847#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); {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 73: Hoare triple {65847#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 74: Hoare triple {65847#false} ~skip~0 := 0; {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 75: Hoare triple {65847#false} assume !false; {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 76: Hoare triple {65847#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); {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 77: Hoare triple {65847#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 78: Hoare triple {65847#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 79: Hoare triple {65847#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 80: Hoare triple {65847#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 81: Hoare triple {65847#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 82: Hoare triple {65847#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 83: Hoare triple {65847#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 84: Hoare triple {65847#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 85: Hoare triple {65847#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,899 INFO L290 TraceCheckUtils]: 86: Hoare triple {65847#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 87: Hoare triple {65847#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 88: Hoare triple {65847#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 89: Hoare triple {65847#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 90: Hoare triple {65847#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 91: Hoare triple {65847#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 92: Hoare triple {65847#false} assume 8528 == #t~mem62;havoc #t~mem62; {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 93: Hoare triple {65847#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); {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 94: Hoare triple {65847#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; {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 95: Hoare triple {65847#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); {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 96: Hoare triple {65847#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 97: Hoare triple {65847#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 98: Hoare triple {65847#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 99: Hoare triple {65847#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 100: Hoare triple {65847#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); {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 101: Hoare triple {65847#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 102: Hoare triple {65847#false} ~skip~0 := 0; {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 103: Hoare triple {65847#false} assume !false; {65847#false} is VALID [2022-04-27 15:37:53,900 INFO L290 TraceCheckUtils]: 104: Hoare triple {65847#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); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 105: Hoare triple {65847#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 106: Hoare triple {65847#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 107: Hoare triple {65847#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 108: Hoare triple {65847#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 109: Hoare triple {65847#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 110: Hoare triple {65847#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 111: Hoare triple {65847#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 112: Hoare triple {65847#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 113: Hoare triple {65847#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 114: Hoare triple {65847#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 115: Hoare triple {65847#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 116: Hoare triple {65847#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 117: Hoare triple {65847#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 118: Hoare triple {65847#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 119: Hoare triple {65847#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 120: Hoare triple {65847#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,901 INFO L290 TraceCheckUtils]: 121: Hoare triple {65847#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,902 INFO L290 TraceCheckUtils]: 122: Hoare triple {65847#false} assume 8544 == #t~mem64;havoc #t~mem64; {65847#false} is VALID [2022-04-27 15:37:53,902 INFO L290 TraceCheckUtils]: 123: Hoare triple {65847#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {65847#false} is VALID [2022-04-27 15:37:53,902 INFO L290 TraceCheckUtils]: 124: Hoare triple {65847#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); {65847#false} is VALID [2022-04-27 15:37:53,902 INFO L290 TraceCheckUtils]: 125: Hoare triple {65847#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {65847#false} is VALID [2022-04-27 15:37:53,902 INFO L290 TraceCheckUtils]: 126: Hoare triple {65847#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); {65847#false} is VALID [2022-04-27 15:37:53,902 INFO L290 TraceCheckUtils]: 127: Hoare triple {65847#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; {65847#false} is VALID [2022-04-27 15:37:53,902 INFO L290 TraceCheckUtils]: 128: Hoare triple {65847#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; {65847#false} is VALID [2022-04-27 15:37:53,902 INFO L290 TraceCheckUtils]: 129: Hoare triple {65847#false} assume 7 == ~blastFlag~0; {65847#false} is VALID [2022-04-27 15:37:53,902 INFO L290 TraceCheckUtils]: 130: Hoare triple {65847#false} assume !false; {65847#false} is VALID [2022-04-27 15:37:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-04-27 15:37:53,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:37:53,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583540990] [2022-04-27 15:37:53,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583540990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:37:53,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:37:53,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:37:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333808701] [2022-04-27 15:37:53,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:37:53,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 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:37:53,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:37:53,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 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:37:53,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:53,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:37:53,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:37:53,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:37:53,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:37:53,957 INFO L87 Difference]: Start difference. First operand 882 states and 1299 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 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:37:57,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:57,057 INFO L93 Difference]: Finished difference Result 1740 states and 2571 transitions. [2022-04-27 15:37:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:37:57,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 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:37:57,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:37:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 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:37:57,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-27 15:37:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 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:37:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-27 15:37:57,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 425 transitions. [2022-04-27 15:37:57,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:57,347 INFO L225 Difference]: With dead ends: 1740 [2022-04-27 15:37:57,347 INFO L226 Difference]: Without dead ends: 884 [2022-04-27 15:37:57,348 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:37:57,348 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:37:57,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 396 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 15:37:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2022-04-27 15:37:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 884. [2022-04-27 15:37:57,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:37:57,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 884 states. Second operand has 884 states, 879 states have (on average 1.4755403868031853) internal successors, (1297), 879 states have internal predecessors, (1297), 3 states have call successors, (3), 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:37:57,359 INFO L74 IsIncluded]: Start isIncluded. First operand 884 states. Second operand has 884 states, 879 states have (on average 1.4755403868031853) internal successors, (1297), 879 states have internal predecessors, (1297), 3 states have call successors, (3), 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:37:57,360 INFO L87 Difference]: Start difference. First operand 884 states. Second operand has 884 states, 879 states have (on average 1.4755403868031853) internal successors, (1297), 879 states have internal predecessors, (1297), 3 states have call successors, (3), 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:37:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:57,384 INFO L93 Difference]: Finished difference Result 884 states and 1301 transitions. [2022-04-27 15:37:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1301 transitions. [2022-04-27 15:37:57,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:57,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:57,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 884 states, 879 states have (on average 1.4755403868031853) internal successors, (1297), 879 states have internal predecessors, (1297), 3 states have call successors, (3), 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 884 states. [2022-04-27 15:37:57,386 INFO L87 Difference]: Start difference. First operand has 884 states, 879 states have (on average 1.4755403868031853) internal successors, (1297), 879 states have internal predecessors, (1297), 3 states have call successors, (3), 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 884 states. [2022-04-27 15:37:57,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:37:57,410 INFO L93 Difference]: Finished difference Result 884 states and 1301 transitions. [2022-04-27 15:37:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1301 transitions. [2022-04-27 15:37:57,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:37:57,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:37:57,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:37:57,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:37:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 879 states have (on average 1.4755403868031853) internal successors, (1297), 879 states have internal predecessors, (1297), 3 states have call successors, (3), 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:37:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1301 transitions. [2022-04-27 15:37:57,437 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1301 transitions. Word has length 131 [2022-04-27 15:37:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:37:57,437 INFO L495 AbstractCegarLoop]: Abstraction has 884 states and 1301 transitions. [2022-04-27 15:37:57,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 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:37:57,437 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1301 transitions. [2022-04-27 15:37:57,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-27 15:37:57,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:37:57,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:57,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-27 15:37:57,438 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:37:57,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:37:57,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1541930600, now seen corresponding path program 1 times [2022-04-27 15:37:57,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:37:57,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778010770] [2022-04-27 15:37:57,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:37:57,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:37:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:57,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:37:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:37:57,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {70530#(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); {70524#true} is VALID [2022-04-27 15:37:57,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {70524#true} assume true; {70524#true} is VALID [2022-04-27 15:37:57,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70524#true} {70524#true} #690#return; {70524#true} is VALID [2022-04-27 15:37:57,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {70524#true} call ULTIMATE.init(); {70530#(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:37:57,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {70530#(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); {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {70524#true} assume true; {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70524#true} {70524#true} #690#return; {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {70524#true} call #t~ret161 := main(); {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {70524#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; {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {70524#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L272 TraceCheckUtils]: 7: Hoare triple {70524#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {70524#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); {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {70524#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; {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {70524#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; {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {70524#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {70524#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {70524#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {70524#true} assume !false; {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {70524#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); {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {70524#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {70524#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {70524#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {70524#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {70524#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {70524#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {70524#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {70524#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {70524#true} assume 8464 == #t~mem55;havoc #t~mem55; {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {70524#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; {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {70524#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {70524#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); {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {70524#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); {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {70524#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {70524#true} ~skip~0 := 0; {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {70524#true} assume !false; {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {70524#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); {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {70524#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {70524#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {70524#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 36: Hoare triple {70524#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 37: Hoare triple {70524#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 38: Hoare triple {70524#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {70524#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 40: Hoare triple {70524#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 41: Hoare triple {70524#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 42: Hoare triple {70524#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 43: Hoare triple {70524#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {70524#true} assume 8496 == #t~mem58;havoc #t~mem58; {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {70524#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {70524#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {70524#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {70524#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 49: Hoare triple {70524#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 50: Hoare triple {70524#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); {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 51: Hoare triple {70524#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70524#true} is VALID [2022-04-27 15:37:57,566 INFO L290 TraceCheckUtils]: 52: Hoare triple {70524#true} ~skip~0 := 0; {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 53: Hoare triple {70524#true} assume !false; {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {70524#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); {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 55: Hoare triple {70524#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 56: Hoare triple {70524#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {70524#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 58: Hoare triple {70524#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 59: Hoare triple {70524#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 60: Hoare triple {70524#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 61: Hoare triple {70524#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 62: Hoare triple {70524#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 63: Hoare triple {70524#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 64: Hoare triple {70524#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {70524#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 66: Hoare triple {70524#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 67: Hoare triple {70524#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 68: Hoare triple {70524#true} assume 8512 == #t~mem60;havoc #t~mem60; {70524#true} is VALID [2022-04-27 15:37:57,567 INFO L290 TraceCheckUtils]: 69: Hoare triple {70524#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); {70524#true} is VALID [2022-04-27 15:37:57,568 INFO L290 TraceCheckUtils]: 70: Hoare triple {70524#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;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {70524#true} is VALID [2022-04-27 15:37:57,568 INFO L290 TraceCheckUtils]: 71: Hoare triple {70524#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,568 INFO L290 TraceCheckUtils]: 72: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(~ret~0 <= 0); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,569 INFO L290 TraceCheckUtils]: 73: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,569 INFO L290 TraceCheckUtils]: 74: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} 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); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,569 INFO L290 TraceCheckUtils]: 75: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,569 INFO L290 TraceCheckUtils]: 76: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,570 INFO L290 TraceCheckUtils]: 77: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,570 INFO L290 TraceCheckUtils]: 78: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} 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); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,570 INFO L290 TraceCheckUtils]: 79: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,570 INFO L290 TraceCheckUtils]: 80: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,571 INFO L290 TraceCheckUtils]: 81: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,571 INFO L290 TraceCheckUtils]: 82: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,571 INFO L290 TraceCheckUtils]: 83: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,571 INFO L290 TraceCheckUtils]: 84: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,572 INFO L290 TraceCheckUtils]: 85: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,572 INFO L290 TraceCheckUtils]: 86: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,572 INFO L290 TraceCheckUtils]: 87: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,572 INFO L290 TraceCheckUtils]: 88: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,573 INFO L290 TraceCheckUtils]: 89: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,573 INFO L290 TraceCheckUtils]: 90: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,573 INFO L290 TraceCheckUtils]: 91: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,573 INFO L290 TraceCheckUtils]: 92: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,574 INFO L290 TraceCheckUtils]: 93: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,574 INFO L290 TraceCheckUtils]: 94: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume 8528 == #t~mem62;havoc #t~mem62; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,574 INFO L290 TraceCheckUtils]: 95: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} 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); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,574 INFO L290 TraceCheckUtils]: 96: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} 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; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,575 INFO L290 TraceCheckUtils]: 97: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} 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); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,575 INFO L290 TraceCheckUtils]: 98: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,575 INFO L290 TraceCheckUtils]: 99: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,575 INFO L290 TraceCheckUtils]: 100: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,576 INFO L290 TraceCheckUtils]: 101: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,576 INFO L290 TraceCheckUtils]: 102: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} 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); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,576 INFO L290 TraceCheckUtils]: 103: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,577 INFO L290 TraceCheckUtils]: 104: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,577 INFO L290 TraceCheckUtils]: 105: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,577 INFO L290 TraceCheckUtils]: 106: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} 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); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,577 INFO L290 TraceCheckUtils]: 107: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,578 INFO L290 TraceCheckUtils]: 108: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,578 INFO L290 TraceCheckUtils]: 109: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,578 INFO L290 TraceCheckUtils]: 110: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,578 INFO L290 TraceCheckUtils]: 111: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,579 INFO L290 TraceCheckUtils]: 112: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,579 INFO L290 TraceCheckUtils]: 113: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,579 INFO L290 TraceCheckUtils]: 114: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,579 INFO L290 TraceCheckUtils]: 115: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,580 INFO L290 TraceCheckUtils]: 116: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,580 INFO L290 TraceCheckUtils]: 117: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,580 INFO L290 TraceCheckUtils]: 118: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,580 INFO L290 TraceCheckUtils]: 119: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,581 INFO L290 TraceCheckUtils]: 120: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,581 INFO L290 TraceCheckUtils]: 121: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,581 INFO L290 TraceCheckUtils]: 122: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,581 INFO L290 TraceCheckUtils]: 123: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,582 INFO L290 TraceCheckUtils]: 124: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume 8544 == #t~mem64;havoc #t~mem64; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,582 INFO L290 TraceCheckUtils]: 125: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,582 INFO L290 TraceCheckUtils]: 126: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} 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); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,582 INFO L290 TraceCheckUtils]: 127: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,583 INFO L290 TraceCheckUtils]: 128: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} 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); {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,583 INFO L290 TraceCheckUtils]: 129: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} 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; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,583 INFO L290 TraceCheckUtils]: 130: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} 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; {70529#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:37:57,583 INFO L290 TraceCheckUtils]: 131: Hoare triple {70529#(<= ssl3_accept_~blastFlag~0 6)} assume 7 == ~blastFlag~0; {70525#false} is VALID [2022-04-27 15:37:57,584 INFO L290 TraceCheckUtils]: 132: Hoare triple {70525#false} assume !false; {70525#false} is VALID [2022-04-27 15:37:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 15:37:57,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:37:57,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778010770] [2022-04-27 15:37:57,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778010770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:37:57,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:37:57,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:37:57,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438549833] [2022-04-27 15:37:57,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:37:57,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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 133 [2022-04-27 15:37:57,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:37:57,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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:37:57,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:37:57,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:37:57,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:37:57,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:37:57,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:37:57,648 INFO L87 Difference]: Start difference. First operand 884 states and 1301 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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:38:02,440 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:38:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:38:03,195 INFO L93 Difference]: Finished difference Result 2177 states and 3224 transitions. [2022-04-27 15:38:03,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:38:03,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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 133 [2022-04-27 15:38:03,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:38:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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:38:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-27 15:38:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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:38:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-27 15:38:03,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 607 transitions. [2022-04-27 15:38:03,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:38:03,599 INFO L225 Difference]: With dead ends: 2177 [2022-04-27 15:38:03,599 INFO L226 Difference]: Without dead ends: 1321 [2022-04-27 15:38:03,600 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:38:03,600 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 157 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:38:03,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 380 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:38:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2022-04-27 15:38:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1319. [2022-04-27 15:38:03,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:38:03,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1321 states. Second operand has 1319 states, 1314 states have (on average 1.482496194824962) internal successors, (1948), 1314 states have internal predecessors, (1948), 3 states have call successors, (3), 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:38:03,647 INFO L74 IsIncluded]: Start isIncluded. First operand 1321 states. Second operand has 1319 states, 1314 states have (on average 1.482496194824962) internal successors, (1948), 1314 states have internal predecessors, (1948), 3 states have call successors, (3), 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:38:03,648 INFO L87 Difference]: Start difference. First operand 1321 states. Second operand has 1319 states, 1314 states have (on average 1.482496194824962) internal successors, (1948), 1314 states have internal predecessors, (1948), 3 states have call successors, (3), 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:38:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:38:03,692 INFO L93 Difference]: Finished difference Result 1321 states and 1953 transitions. [2022-04-27 15:38:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1953 transitions. [2022-04-27 15:38:03,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:38:03,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:38:03,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 1319 states, 1314 states have (on average 1.482496194824962) internal successors, (1948), 1314 states have internal predecessors, (1948), 3 states have call successors, (3), 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 1321 states. [2022-04-27 15:38:03,695 INFO L87 Difference]: Start difference. First operand has 1319 states, 1314 states have (on average 1.482496194824962) internal successors, (1948), 1314 states have internal predecessors, (1948), 3 states have call successors, (3), 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 1321 states. [2022-04-27 15:38:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:38:03,740 INFO L93 Difference]: Finished difference Result 1321 states and 1953 transitions. [2022-04-27 15:38:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1953 transitions. [2022-04-27 15:38:03,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:38:03,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:38:03,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:38:03,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:38:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1314 states have (on average 1.482496194824962) internal successors, (1948), 1314 states have internal predecessors, (1948), 3 states have call successors, (3), 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:38:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1952 transitions. [2022-04-27 15:38:03,792 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1952 transitions. Word has length 133 [2022-04-27 15:38:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:38:03,792 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 1952 transitions. [2022-04-27 15:38:03,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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:38:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1952 transitions. [2022-04-27 15:38:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-27 15:38:03,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:38:03,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:03,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-27 15:38:03,794 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:38:03,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:38:03,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1653660413, now seen corresponding path program 1 times [2022-04-27 15:38:03,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:38:03,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392232686] [2022-04-27 15:38:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:38:03,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:38:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:38:04,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:38:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:38:04,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {77042#(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); {77033#true} is VALID [2022-04-27 15:38:04,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {77033#true} assume true; {77033#true} is VALID [2022-04-27 15:38:04,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77033#true} {77033#true} #690#return; {77033#true} is VALID [2022-04-27 15:38:04,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {77033#true} call ULTIMATE.init(); {77042#(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:38:04,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {77042#(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); {77033#true} is VALID [2022-04-27 15:38:04,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {77033#true} assume true; {77033#true} is VALID [2022-04-27 15:38:04,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77033#true} {77033#true} #690#return; {77033#true} is VALID [2022-04-27 15:38:04,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {77033#true} call #t~ret161 := main(); {77033#true} is VALID [2022-04-27 15:38:04,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {77033#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; {77033#true} is VALID [2022-04-27 15:38:04,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {77033#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {77038#(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:38:04,119 INFO L272 TraceCheckUtils]: 7: Hoare triple {77038#(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); {77039#(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:38:04,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {77039#(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); {77040#(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:38:04,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {77040#(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; {77040#(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:38:04,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {77040#(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; {77040#(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:38:04,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {77040#(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)))); {77040#(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:38:04,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {77040#(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); {77041#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-27 15:38:04,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {77041#(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; {77034#false} is VALID [2022-04-27 15:38:04,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {77034#false} assume !false; {77034#false} is VALID [2022-04-27 15:38:04,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {77034#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {77034#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {77034#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {77034#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {77034#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {77034#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {77034#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {77034#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {77034#false} assume 8464 == #t~mem55;havoc #t~mem55; {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {77034#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; {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {77034#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {77034#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {77034#false} ~skip~0 := 0; {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {77034#false} assume !false; {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {77034#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {77034#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {77034#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {77034#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {77034#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {77034#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {77034#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {77034#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {77034#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {77034#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 43: Hoare triple {77034#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {77034#false} assume 8496 == #t~mem58;havoc #t~mem58; {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 45: Hoare triple {77034#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 46: Hoare triple {77034#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {77034#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {77034#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {77034#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 51: Hoare triple {77034#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {77034#false} is VALID [2022-04-27 15:38:04,125 INFO L290 TraceCheckUtils]: 52: Hoare triple {77034#false} ~skip~0 := 0; {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {77034#false} assume !false; {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 55: Hoare triple {77034#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 56: Hoare triple {77034#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 57: Hoare triple {77034#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 58: Hoare triple {77034#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 59: Hoare triple {77034#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {77034#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 61: Hoare triple {77034#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 62: Hoare triple {77034#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 63: Hoare triple {77034#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 64: Hoare triple {77034#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 65: Hoare triple {77034#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 66: Hoare triple {77034#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 67: Hoare triple {77034#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 68: Hoare triple {77034#false} assume 8512 == #t~mem60;havoc #t~mem60; {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 69: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,126 INFO L290 TraceCheckUtils]: 70: Hoare triple {77034#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;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 71: Hoare triple {77034#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 72: Hoare triple {77034#false} assume !(~ret~0 <= 0); {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 73: Hoare triple {77034#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 74: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 75: Hoare triple {77034#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 76: Hoare triple {77034#false} ~skip~0 := 0; {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 77: Hoare triple {77034#false} assume !false; {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 78: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 79: Hoare triple {77034#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 80: Hoare triple {77034#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 81: Hoare triple {77034#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 82: Hoare triple {77034#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 83: Hoare triple {77034#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 84: Hoare triple {77034#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 85: Hoare triple {77034#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 86: Hoare triple {77034#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,127 INFO L290 TraceCheckUtils]: 87: Hoare triple {77034#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,128 INFO L290 TraceCheckUtils]: 88: Hoare triple {77034#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,128 INFO L290 TraceCheckUtils]: 89: Hoare triple {77034#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,128 INFO L290 TraceCheckUtils]: 90: Hoare triple {77034#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,128 INFO L290 TraceCheckUtils]: 91: Hoare triple {77034#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,128 INFO L290 TraceCheckUtils]: 92: Hoare triple {77034#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,128 INFO L290 TraceCheckUtils]: 93: Hoare triple {77034#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,128 INFO L290 TraceCheckUtils]: 94: Hoare triple {77034#false} assume 8528 == #t~mem62;havoc #t~mem62; {77034#false} is VALID [2022-04-27 15:38:04,128 INFO L290 TraceCheckUtils]: 95: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,128 INFO L290 TraceCheckUtils]: 96: Hoare triple {77034#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; {77034#false} is VALID [2022-04-27 15:38:04,128 INFO L290 TraceCheckUtils]: 97: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,128 INFO L290 TraceCheckUtils]: 98: Hoare triple {77034#false} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {77034#false} is VALID [2022-04-27 15:38:04,128 INFO L290 TraceCheckUtils]: 99: Hoare triple {77034#false} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {77034#false} is VALID [2022-04-27 15:38:04,128 INFO L290 TraceCheckUtils]: 100: Hoare triple {77034#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {77034#false} is VALID [2022-04-27 15:38:04,143 INFO L290 TraceCheckUtils]: 101: Hoare triple {77034#false} assume !(~ret~0 <= 0); {77034#false} is VALID [2022-04-27 15:38:04,143 INFO L290 TraceCheckUtils]: 102: Hoare triple {77034#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,143 INFO L290 TraceCheckUtils]: 103: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,143 INFO L290 TraceCheckUtils]: 104: Hoare triple {77034#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {77034#false} is VALID [2022-04-27 15:38:04,143 INFO L290 TraceCheckUtils]: 105: Hoare triple {77034#false} ~skip~0 := 0; {77034#false} is VALID [2022-04-27 15:38:04,143 INFO L290 TraceCheckUtils]: 106: Hoare triple {77034#false} assume !false; {77034#false} is VALID [2022-04-27 15:38:04,143 INFO L290 TraceCheckUtils]: 107: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,143 INFO L290 TraceCheckUtils]: 108: Hoare triple {77034#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,143 INFO L290 TraceCheckUtils]: 109: Hoare triple {77034#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,143 INFO L290 TraceCheckUtils]: 110: Hoare triple {77034#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,143 INFO L290 TraceCheckUtils]: 111: Hoare triple {77034#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 112: Hoare triple {77034#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 113: Hoare triple {77034#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 114: Hoare triple {77034#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 115: Hoare triple {77034#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 116: Hoare triple {77034#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 117: Hoare triple {77034#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 118: Hoare triple {77034#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 119: Hoare triple {77034#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 120: Hoare triple {77034#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 121: Hoare triple {77034#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 122: Hoare triple {77034#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 123: Hoare triple {77034#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 124: Hoare triple {77034#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 125: Hoare triple {77034#false} assume 8544 == #t~mem64;havoc #t~mem64; {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 126: Hoare triple {77034#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 127: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 128: Hoare triple {77034#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {77034#false} is VALID [2022-04-27 15:38:04,144 INFO L290 TraceCheckUtils]: 129: Hoare triple {77034#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); {77034#false} is VALID [2022-04-27 15:38:04,145 INFO L290 TraceCheckUtils]: 130: Hoare triple {77034#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; {77034#false} is VALID [2022-04-27 15:38:04,145 INFO L290 TraceCheckUtils]: 131: Hoare triple {77034#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; {77034#false} is VALID [2022-04-27 15:38:04,145 INFO L290 TraceCheckUtils]: 132: Hoare triple {77034#false} assume 7 == ~blastFlag~0; {77034#false} is VALID [2022-04-27 15:38:04,145 INFO L290 TraceCheckUtils]: 133: Hoare triple {77034#false} assume !false; {77034#false} is VALID [2022-04-27 15:38:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-04-27 15:38:04,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:38:04,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392232686] [2022-04-27 15:38:04,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392232686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:38:04,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:38:04,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 15:38:04,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355995332] [2022-04-27 15:38:04,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:38:04,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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 134 [2022-04-27 15:38:04,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:38:04,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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:38:04,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:38:04,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 15:38:04,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:38:04,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 15:38:04,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:38:04,198 INFO L87 Difference]: Start difference. First operand 1319 states and 1952 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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:38:06,479 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:38:14,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:38:14,243 INFO L93 Difference]: Finished difference Result 2631 states and 3896 transitions. [2022-04-27 15:38:14,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:38:14,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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 134 [2022-04-27 15:38:14,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:38:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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:38:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-27 15:38:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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:38:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-27 15:38:14,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 422 transitions. [2022-04-27 15:38:14,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:38:14,536 INFO L225 Difference]: With dead ends: 2631 [2022-04-27 15:38:14,536 INFO L226 Difference]: Without dead ends: 1319 [2022-04-27 15:38:14,537 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:38:14,537 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:38:14,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 841 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-27 15:38:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-04-27 15:38:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2022-04-27 15:38:14,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:38:14,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1319 states. Second operand has 1319 states, 1314 states have (on average 1.4817351598173516) internal successors, (1947), 1314 states have internal predecessors, (1947), 3 states have call successors, (3), 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:38:14,592 INFO L74 IsIncluded]: Start isIncluded. First operand 1319 states. Second operand has 1319 states, 1314 states have (on average 1.4817351598173516) internal successors, (1947), 1314 states have internal predecessors, (1947), 3 states have call successors, (3), 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:38:14,592 INFO L87 Difference]: Start difference. First operand 1319 states. Second operand has 1319 states, 1314 states have (on average 1.4817351598173516) internal successors, (1947), 1314 states have internal predecessors, (1947), 3 states have call successors, (3), 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:38:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:38:14,637 INFO L93 Difference]: Finished difference Result 1319 states and 1951 transitions. [2022-04-27 15:38:14,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1951 transitions. [2022-04-27 15:38:14,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:38:14,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:38:14,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 1319 states, 1314 states have (on average 1.4817351598173516) internal successors, (1947), 1314 states have internal predecessors, (1947), 3 states have call successors, (3), 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 1319 states. [2022-04-27 15:38:14,640 INFO L87 Difference]: Start difference. First operand has 1319 states, 1314 states have (on average 1.4817351598173516) internal successors, (1947), 1314 states have internal predecessors, (1947), 3 states have call successors, (3), 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 1319 states. [2022-04-27 15:38:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:38:14,685 INFO L93 Difference]: Finished difference Result 1319 states and 1951 transitions. [2022-04-27 15:38:14,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1951 transitions. [2022-04-27 15:38:14,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:38:14,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:38:14,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:38:14,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:38:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1314 states have (on average 1.4817351598173516) internal successors, (1947), 1314 states have internal predecessors, (1947), 3 states have call successors, (3), 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:38:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1951 transitions. [2022-04-27 15:38:14,736 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1951 transitions. Word has length 134 [2022-04-27 15:38:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:38:14,736 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 1951 transitions. [2022-04-27 15:38:14,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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:38:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1951 transitions. [2022-04-27 15:38:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-27 15:38:14,737 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:38:14,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:14,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-27 15:38:14,738 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:38:14,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:38:14,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2056535233, now seen corresponding path program 1 times [2022-04-27 15:38:14,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:38:14,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104007981] [2022-04-27 15:38:14,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:38:14,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:38:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:38:15,149 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 15:38:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:38:15,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 15:38:15,371 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 15:38:15,372 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:38:15,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-27 15:38:15,377 INFO L356 BasicCegarLoop]: Path program 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] [2022-04-27 15:38:15,380 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: SSLv3_server_methodENTRY has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: ssl3_acceptENTRY has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: ssl3_get_server_methodENTRY has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: L1095 has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: L1095 has no Hoare annotation [2022-04-27 15:38:15,491 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1767 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1767 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1095-2 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1095-2 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1767-1 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1146-2 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: ssl3_get_server_methodFINAL has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1063-1 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: SSLv3_server_methodFINAL has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: L1105 has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-27 15:38:15,492 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: SSLv3_server_methodEXIT has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1065-1 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: ssl3_acceptFINAL has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: ssl3_acceptEXIT has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1747 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1751 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1751 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-27 15:38:15,493 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1751-2 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1285-2 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-27 15:38:15,494 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1678 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1716 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1716 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1717 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1717 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1716-1 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1718 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1718 has no Hoare annotation [2022-04-27 15:38:15,495 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1720 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1720 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1718-2 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1718-2 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1729 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1729 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1373-2 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1373-2 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1383 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1383 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-27 15:38:15,496 WARN L170 areAnnotationChecker]: L1383-2 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1392-2 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1396-2 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1396-2 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1413-2 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1435 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1421 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1421 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-27 15:38:15,497 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1437 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1437 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1474 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1511 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1511 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1437-2 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1437-2 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1425 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1425 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1424-1 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-27 15:38:15,498 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1521-1 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1429 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1429 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1487 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1487 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1539 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1539 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1429-2 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1429-2 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1586 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1586 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1492 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1492 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-27 15:38:15,499 WARN L170 areAnnotationChecker]: L1560 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1560 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1258 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1582 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1582 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1588-2 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1588-2 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1585 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1585 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1264 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1600 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1600 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-27 15:38:15,500 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1610 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1610 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1600-2 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1270 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1617-2 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1617-2 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1639 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1639 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1639-2 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1639-2 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1273 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1276 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1650 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1650 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1660 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1660 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1650-2 has no Hoare annotation [2022-04-27 15:38:15,501 WARN L170 areAnnotationChecker]: L1664 has no Hoare annotation [2022-04-27 15:38:15,502 WARN L170 areAnnotationChecker]: L1664 has no Hoare annotation [2022-04-27 15:38:15,502 WARN L170 areAnnotationChecker]: L1660-1 has no Hoare annotation [2022-04-27 15:38:15,502 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 15:38:15,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:38:15 BoogieIcfgContainer [2022-04-27 15:38:15,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:38:15,504 INFO L158 Benchmark]: Toolchain (without parser) took 226615.99ms. Allocated memory was 190.8MB in the beginning and 312.5MB in the end (delta: 121.6MB). Free memory was 136.6MB in the beginning and 174.5MB in the end (delta: -37.9MB). Peak memory consumption was 165.3MB. Max. memory is 8.0GB. [2022-04-27 15:38:15,504 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory was 155.3MB in the beginning and 155.2MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:38:15,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.10ms. Allocated memory is still 190.8MB. Free memory was 136.4MB in the beginning and 142.6MB in the end (delta: -6.2MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2022-04-27 15:38:15,504 INFO L158 Benchmark]: Boogie Preprocessor took 112.39ms. Allocated memory is still 190.8MB. Free memory was 142.6MB in the beginning and 132.5MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 15:38:15,504 INFO L158 Benchmark]: RCFGBuilder took 1589.98ms. Allocated memory was 190.8MB in the beginning and 240.1MB in the end (delta: 49.3MB). Free memory was 132.5MB in the beginning and 146.5MB in the end (delta: -14.0MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-04-27 15:38:15,504 INFO L158 Benchmark]: TraceAbstraction took 224450.22ms. Allocated memory was 240.1MB in the beginning and 312.5MB in the end (delta: 72.4MB). Free memory was 146.0MB in the beginning and 174.5MB in the end (delta: -28.5MB). Peak memory consumption was 125.7MB. Max. memory is 8.0GB. [2022-04-27 15:38:15,505 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.09ms. Allocated memory is still 190.8MB. Free memory was 155.3MB in the beginning and 155.2MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 458.10ms. Allocated memory is still 190.8MB. Free memory was 136.4MB in the beginning and 142.6MB in the end (delta: -6.2MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 112.39ms. Allocated memory is still 190.8MB. Free memory was 142.6MB in the beginning and 132.5MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1589.98ms. Allocated memory was 190.8MB in the beginning and 240.1MB in the end (delta: 49.3MB). Free memory was 132.5MB in the beginning and 146.5MB in the end (delta: -14.0MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 224450.22ms. Allocated memory was 240.1MB in the beginning and 312.5MB in the end (delta: 72.4MB). Free memory was 146.0MB in the beginning and 174.5MB in the end (delta: -28.5MB). Peak memory consumption was 125.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1757]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1475. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=4294967305, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1087] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1088] s->options = __VERIFIER_nondet_ulong() [L1089] s->verify_mode = __VERIFIER_nondet_int() [L1090] EXPR s->session [L1090] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1091] EXPR s->s3 [L1091] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1093] EXPR s->s3 [L1093] EXPR (s->s3)->tmp.new_cipher [L1093] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1095] COND FALSE !(__VERIFIER_nondet_int()) [L1101] s->cert = malloc(sizeof(struct cert_st)) [L1102] EXPR s->cert [L1102] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1105] CALL ssl3_accept(s) VAL [init=1, s={-4294967294:0}, SSLv3_server_data={4:0}] [L1111] BUF_MEM *buf ; [L1112] unsigned long l ; [L1113] unsigned long Time ; [L1114] unsigned long tmp ; [L1115] void (*cb)() ; [L1116] long num1 ; [L1117] int ret ; [L1118] int new_state ; [L1119] int state ; [L1120] int skip ; [L1121] int got_new_session ; [L1122] int tmp___1 = __VERIFIER_nondet_int() ; [L1123] int tmp___2 = __VERIFIER_nondet_int() ; [L1124] int tmp___3 = __VERIFIER_nondet_int() ; [L1125] int tmp___4 = __VERIFIER_nondet_int() ; [L1126] int tmp___5 = __VERIFIER_nondet_int() ; [L1127] int tmp___6 = __VERIFIER_nondet_int() ; [L1128] int tmp___7 ; [L1129] long tmp___8 = __VERIFIER_nondet_long() ; [L1130] int tmp___9 = __VERIFIER_nondet_int() ; [L1131] int tmp___10 = __VERIFIER_nondet_int() ; [L1132] int blastFlag ; [L1136] s->state = 8464 [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->info_callback={0:-5}, skip=0, SSLv3_server_data={4:0}, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:-5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1161] EXPR s->cert VAL [={0:-5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:-5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:-5}, blastFlag=1, got_new_session=0, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:-5}, (s->s3)->tmp.reuse_message=4294967338, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967297:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-5}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->hit=0, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1383] COND FALSE !(s->hit) [L1386] s->state = 8512 VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1388] s->init_num = 0 VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:-5}, (s->s3)->tmp.reuse_message=4294967338, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967297:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-5}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND TRUE s->state == 8512 [L1392] EXPR s->s3 [L1392] EXPR (s->s3)->tmp.new_cipher [L1392] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-5}, ((s->s3)->tmp.new_cipher)->algorithms=4294967327, (s->s3)->tmp.new_cipher={-4294967298:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967297:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1392] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1395] ret = __VERIFIER_nondet_int() [L1396] COND TRUE blastFlag == 2 [L1397] blastFlag = 6 VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1401] COND FALSE !(ret <= 0) VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1407] s->state = 8528 [L1408] s->init_num = 0 VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:-5}, (s->s3)->tmp.reuse_message=4294967338, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967297:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1215] COND TRUE s->state == 8528 [L1412] EXPR s->s3 [L1412] EXPR (s->s3)->tmp.new_cipher [L1412] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1412] l = ((s->s3)->tmp.new_cipher)->algorithms [L1413] EXPR s->options VAL [={0:-5}, blastFlag=6, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->options=4294967315, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1413] COND TRUE s->options & 2097152UL [L1414] EXPR s->s3 [L1414] (s->s3)->tmp.use_rsa_tmp = 1 [L1418] EXPR s->s3 [L1418] (s->s3)->tmp.use_rsa_tmp VAL [={0:-5}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=6, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967297:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1418] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1436] ret = __VERIFIER_nondet_int() [L1437] COND TRUE blastFlag == 6 [L1438] blastFlag = 7 VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1442] COND FALSE !(ret <= 0) VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1459] s->state = 8544 [L1460] s->init_num = 0 VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:-5}, (s->s3)->tmp.reuse_message=4294967338, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967297:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1221] COND TRUE s->state == 8544 [L1464] EXPR s->verify_mode VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->verify_mode=-4, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1464] COND TRUE s->verify_mode & 1 [L1465] EXPR s->session [L1465] EXPR (s->session)->peer VAL [={0:-5}, (s->session)->peer={0:0}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->session={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1465] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1475] EXPR s->s3 [L1475] EXPR (s->s3)->tmp.new_cipher [L1475] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-5}, ((s->s3)->tmp.new_cipher)->algorithms=4294967327, (s->s3)->tmp.new_cipher={-4294967298:0}, blastFlag=7, got_new_session=1, init=1, l=31, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967297:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1475] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1485] EXPR s->s3 [L1485] (s->s3)->tmp.cert_request = 1 [L1486] ret = __VERIFIER_nondet_int() [L1487] COND TRUE blastFlag == 7 VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=0, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] [L1757] reach_error() VAL [={0:-5}, blastFlag=7, got_new_session=1, init=1, l=31, ret=0, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=6, tmp=6, tmp___1=1, tmp___10=0, tmp___2=7, tmp___3=8, tmp___4=0, tmp___5=9, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 189 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 224.3s, OverallIterations: 37, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 215.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 3088 SdHoareTripleChecker+Valid, 99.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3088 mSDsluCounter, 16074 SdHoareTripleChecker+Invalid, 99.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9918 mSDsCounter, 1141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15407 IncrementalHoareTripleChecker+Invalid, 16555 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1141 mSolverCounterUnsat, 6156 mSDtfsCounter, 15407 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1319occurred in iteration=35, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 1706 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 3758 NumberOfCodeBlocks, 3758 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3588 ConstructedInterpolants, 0 QuantifiedInterpolants, 9659 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 2710/2710 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-27 15:38:15,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...