/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.13.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 18:37:17,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 18:37:17,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 18:37:17,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 18:37:17,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 18:37:17,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 18:37:17,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 18:37:17,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 18:37:17,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 18:37:17,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 18:37:17,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 18:37:17,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 18:37:17,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 18:37:17,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 18:37:17,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 18:37:17,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 18:37:17,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 18:37:17,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 18:37:17,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 18:37:17,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 18:37:17,374 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 18:37:17,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 18:37:17,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 18:37:17,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 18:37:17,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 18:37:17,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 18:37:17,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 18:37:17,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 18:37:17,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 18:37:17,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 18:37:17,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 18:37:17,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 18:37:17,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 18:37:17,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 18:37:17,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 18:37:17,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 18:37:17,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 18:37:17,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 18:37:17,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 18:37:17,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 18:37:17,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 18:37:17,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 18:37:17,390 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-14 18:37:17,411 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 18:37:17,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 18:37:17,412 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 18:37:17,412 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 18:37:17,412 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 18:37:17,412 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 18:37:17,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 18:37:17,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 18:37:17,413 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 18:37:17,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 18:37:17,413 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 18:37:17,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 18:37:17,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 18:37:17,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 18:37:17,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 18:37:17,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 18:37:17,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 18:37:17,413 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 18:37:17,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 18:37:17,414 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 18:37:17,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 18:37:17,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 18:37:17,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 18:37:17,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 18:37:17,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 18:37:17,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 18:37:17,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 18:37:17,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 18:37:17,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 18:37:17,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 18:37:17,415 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 18:37:17,415 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 18:37:17,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 18:37:17,415 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-14 18:37:17,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 18:37:17,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 18:37:17,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 18:37:17,610 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 18:37:17,611 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 18:37:17,612 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.13.i.cil-2.c [2022-04-14 18:37:17,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c913b644b/7e282aa16ebf48c2a3e3b37a94ddd1bf/FLAG1d49e4f82 [2022-04-14 18:37:18,080 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 18:37:18,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.13.i.cil-2.c [2022-04-14 18:37:18,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c913b644b/7e282aa16ebf48c2a3e3b37a94ddd1bf/FLAG1d49e4f82 [2022-04-14 18:37:18,107 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c913b644b/7e282aa16ebf48c2a3e3b37a94ddd1bf [2022-04-14 18:37:18,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 18:37:18,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 18:37:18,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 18:37:18,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 18:37:18,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 18:37:18,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 06:37:18" (1/1) ... [2022-04-14 18:37:18,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7373e02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:37:18, skipping insertion in model container [2022-04-14 18:37:18,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 06:37:18" (1/1) ... [2022-04-14 18:37:18,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 18:37:18,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 18:37:18,449 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.13.i.cil-2.c[74353,74366] [2022-04-14 18:37:18,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 18:37:18,472 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 18:37:18,558 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.13.i.cil-2.c[74353,74366] [2022-04-14 18:37:18,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 18:37:18,578 INFO L208 MainTranslator]: Completed translation [2022-04-14 18:37:18,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:37:18 WrapperNode [2022-04-14 18:37:18,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 18:37:18,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 18:37:18,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 18:37:18,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 18:37:18,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:37:18" (1/1) ... [2022-04-14 18:37:18,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:37:18" (1/1) ... [2022-04-14 18:37:18,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:37:18" (1/1) ... [2022-04-14 18:37:18,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:37:18" (1/1) ... [2022-04-14 18:37:18,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:37:18" (1/1) ... [2022-04-14 18:37:18,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:37:18" (1/1) ... [2022-04-14 18:37:18,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:37:18" (1/1) ... [2022-04-14 18:37:18,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 18:37:18,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 18:37:18,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 18:37:18,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 18:37:18,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:37:18" (1/1) ... [2022-04-14 18:37:18,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 18:37:18,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:37:18,717 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-14 18:37:18,723 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-14 18:37:18,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 18:37:18,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 18:37:18,749 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 18:37:18,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-14 18:37:18,750 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-14 18:37:18,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 18:37:18,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-14 18:37:18,750 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-14 18:37:18,750 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-14 18:37:18,751 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-14 18:37:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 18:37:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 18:37:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 18:37:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 18:37:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-14 18:37:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-14 18:37:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 18:37:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-14 18:37:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-14 18:37:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-14 18:37:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-14 18:37:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-14 18:37:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-14 18:37:18,751 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-14 18:37:18,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-14 18:37:18,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-14 18:37:18,752 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 18:37:18,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-14 18:37:18,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 18:37:18,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-14 18:37:18,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 18:37:18,752 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-14 18:37:18,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-14 18:37:18,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 18:37:18,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 18:37:18,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 18:37:18,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-14 18:37:18,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-14 18:37:18,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-14 18:37:18,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-14 18:37:18,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 18:37:18,904 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 18:37:18,905 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 18:37:19,690 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-14 18:37:20,062 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-14 18:37:20,062 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-14 18:37:20,072 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 18:37:20,079 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 18:37:20,080 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 18:37:20,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:37:20 BoogieIcfgContainer [2022-04-14 18:37:20,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 18:37:20,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 18:37:20,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 18:37:20,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 18:37:20,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 06:37:18" (1/3) ... [2022-04-14 18:37:20,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18894c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 06:37:20, skipping insertion in model container [2022-04-14 18:37:20,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:37:18" (2/3) ... [2022-04-14 18:37:20,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18894c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 06:37:20, skipping insertion in model container [2022-04-14 18:37:20,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:37:20" (3/3) ... [2022-04-14 18:37:20,086 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-2.c [2022-04-14 18:37:20,090 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 18:37:20,090 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 18:37:20,117 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 18:37:20,120 INFO L340 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 [2022-04-14 18:37:20,121 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 18:37:20,136 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-14 18:37:20,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-14 18:37:20,140 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:37:20,141 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:37:20,141 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:37:20,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:37:20,144 INFO L85 PathProgramCache]: Analyzing trace with hash -671352377, now seen corresponding path program 1 times [2022-04-14 18:37:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:37:20,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715725726] [2022-04-14 18:37:20,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:37:20,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:37:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:20,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:37:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:20,593 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {161#true} is VALID [2022-04-14 18:37:20,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-14 18:37:20,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #690#return; {161#true} is VALID [2022-04-14 18:37:20,596 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-14 18:37:20,596 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {161#true} is VALID [2022-04-14 18:37:20,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-14 18:37:20,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #690#return; {161#true} is VALID [2022-04-14 18:37:20,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-14 18:37:20,597 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-14 18:37:20,597 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-14 18:37:20,597 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-14 18:37:20,600 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-14 18:37:20,603 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-14 18:37:20,604 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-14 18:37:20,605 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-14 18:37:20,605 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-14 18:37:20,606 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-14 18:37:20,607 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-14 18:37:20,607 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-14 18:37:20,608 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-14 18:37:20,608 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-14 18:37:20,609 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-14 18:37:20,610 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-14 18:37:20,611 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-14 18:37:20,612 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-14 18:37:20,613 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-14 18:37:20,614 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-14 18:37:20,614 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-14 18:37:20,615 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-14 18:37:20,615 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-14 18:37:20,616 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-14 18:37:20,617 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-14 18:37:20,618 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-14 18:37:20,618 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-14 18:37:20,619 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-14 18:37:20,620 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-14 18:37:20,620 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-14 18:37:20,620 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-14 18:37:20,621 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-14 18:37:20,621 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-14 18:37:20,621 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-14 18:37:20,621 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-14 18:37:20,621 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-14 18:37:20,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 8 == ~blastFlag~0; {162#false} is VALID [2022-04-14 18:37:20,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-14 18:37:20,624 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-14 18:37:20,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:37:20,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715725726] [2022-04-14 18:37:20,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715725726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:37:20,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:37:20,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:37:20,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273683968] [2022-04-14 18:37:20,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:37:20,641 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-14 18:37:20,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:37:20,645 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-14 18:37:20,691 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-14 18:37:20,691 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:37:20,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:37:20,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:37:20,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:37:20,730 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-14 18:37:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:24,019 INFO L93 Difference]: Finished difference Result 430 states and 727 transitions. [2022-04-14 18:37:24,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:37:24,019 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-14 18:37:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:37:24,020 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-14 18:37:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-14 18:37:24,031 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-14 18:37:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-14 18:37:24,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 727 transitions. [2022-04-14 18:37:24,555 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-14 18:37:24,570 INFO L225 Difference]: With dead ends: 430 [2022-04-14 18:37:24,570 INFO L226 Difference]: Without dead ends: 261 [2022-04-14 18:37:24,573 INFO L912 BasicCegarLoop]: 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-14 18:37:24,575 INFO L913 BasicCegarLoop]: 157 mSDtfsCounter, 167 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:37:24,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 461 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-14 18:37:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-14 18:37:24,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 170. [2022-04-14 18:37:24,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:37:24,622 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-14 18:37:24,622 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-14 18:37:24,623 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-14 18:37:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:24,631 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-14 18:37:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-14 18:37:24,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:37:24,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:37:24,633 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-14 18:37:24,634 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-14 18:37:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:24,642 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-14 18:37:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-14 18:37:24,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:37:24,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:37:24,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:37:24,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:37:24,644 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-14 18:37:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-14 18:37:24,649 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-14 18:37:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:37:24,649 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-14 18:37:24,650 INFO L479 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-14 18:37:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-14 18:37:24,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 18:37:24,651 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:37:24,651 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:37:24,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 18:37:24,651 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:37:24,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:37:24,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1244096364, now seen corresponding path program 1 times [2022-04-14 18:37:24,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:37:24,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653995713] [2022-04-14 18:37:24,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:37:24,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:37:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:24,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:37:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:24,773 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {1410#true} is VALID [2022-04-14 18:37:24,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {1410#true} assume true; {1410#true} is VALID [2022-04-14 18:37:24,774 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1410#true} {1410#true} #690#return; {1410#true} is VALID [2022-04-14 18:37:24,775 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-14 18:37:24,775 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {1410#true} is VALID [2022-04-14 18:37:24,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {1410#true} assume true; {1410#true} is VALID [2022-04-14 18:37:24,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1410#true} {1410#true} #690#return; {1410#true} is VALID [2022-04-14 18:37:24,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {1410#true} call #t~ret161 := main(); {1410#true} is VALID [2022-04-14 18:37:24,775 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-14 18:37:24,775 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-14 18:37:24,776 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-14 18:37:24,777 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-14 18:37:24,778 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-14 18:37:24,779 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-14 18:37:24,779 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-14 18:37:24,779 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-14 18:37:24,780 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-14 18:37:24,780 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-14 18:37:24,781 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-14 18:37:24,781 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-14 18:37:24,781 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-14 18:37:24,782 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-14 18:37:24,782 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-14 18:37:24,783 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-14 18:37:24,783 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-14 18:37:24,783 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-14 18:37:24,784 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-14 18:37:24,784 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-14 18:37:24,785 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-14 18:37:24,785 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-14 18:37:24,785 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-14 18:37:24,786 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-14 18:37:24,786 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-14 18:37:24,786 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-14 18:37:24,787 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-14 18:37:24,787 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-14 18:37:24,788 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-14 18:37:24,788 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-14 18:37:24,788 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-14 18:37:24,788 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-14 18:37:24,788 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-14 18:37:24,788 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-14 18:37:24,789 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-14 18:37:24,789 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-14 18:37:24,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {1411#false} assume 8 == ~blastFlag~0; {1411#false} is VALID [2022-04-14 18:37:24,789 INFO L290 TraceCheckUtils]: 42: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2022-04-14 18:37:24,789 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-14 18:37:24,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:37:24,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653995713] [2022-04-14 18:37:24,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653995713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:37:24,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:37:24,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:37:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445488150] [2022-04-14 18:37:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:37:24,791 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-14 18:37:24,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:37:24,791 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-14 18:37:24,835 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-14 18:37:24,836 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:37:24,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:37:24,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:37:24,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:37:24,839 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-14 18:37:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:29,189 INFO L93 Difference]: Finished difference Result 444 states and 697 transitions. [2022-04-14 18:37:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:37:29,189 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-14 18:37:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:37:29,190 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-14 18:37:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-14 18:37:29,195 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-14 18:37:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-14 18:37:29,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-14 18:37:29,593 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-14 18:37:29,598 INFO L225 Difference]: With dead ends: 444 [2022-04-14 18:37:29,598 INFO L226 Difference]: Without dead ends: 289 [2022-04-14 18:37:29,599 INFO L912 BasicCegarLoop]: 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-14 18:37:29,600 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 134 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:37:29,600 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-14 18:37:29,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-14 18:37:29,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 199. [2022-04-14 18:37:29,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:37:29,607 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-14 18:37:29,608 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-14 18:37:29,608 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-14 18:37:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:29,615 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-14 18:37:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-14 18:37:29,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:37:29,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:37:29,617 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-14 18:37:29,617 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-14 18:37:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:29,624 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-14 18:37:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-14 18:37:29,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:37:29,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:37:29,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:37:29,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:37:29,625 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-14 18:37:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-14 18:37:29,629 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-14 18:37:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:37:29,630 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-14 18:37:29,630 INFO L479 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-14 18:37:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-14 18:37:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-14 18:37:29,631 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:37:29,631 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:37:29,631 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 18:37:29,631 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:37:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:37:29,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2016462011, now seen corresponding path program 1 times [2022-04-14 18:37:29,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:37:29,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620364057] [2022-04-14 18:37:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:37:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:37:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:29,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:37:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:29,796 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {2755#true} is VALID [2022-04-14 18:37:29,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {2755#true} assume true; {2755#true} is VALID [2022-04-14 18:37:29,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2755#true} {2755#true} #690#return; {2755#true} is VALID [2022-04-14 18:37:29,797 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-14 18:37:29,798 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {2755#true} is VALID [2022-04-14 18:37:29,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {2755#true} assume true; {2755#true} is VALID [2022-04-14 18:37:29,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2755#true} {2755#true} #690#return; {2755#true} is VALID [2022-04-14 18:37:29,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {2755#true} call #t~ret161 := main(); {2755#true} is VALID [2022-04-14 18:37:29,798 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-14 18:37:29,798 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-14 18:37:29,798 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-14 18:37:29,800 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-14 18:37:29,801 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-14 18:37:29,801 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-14 18:37:29,803 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-14 18:37:29,804 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-14 18:37:29,804 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-14 18:37:29,804 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-14 18:37:29,805 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-14 18:37:29,805 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-14 18:37:29,805 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-14 18:37:29,806 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-14 18:37:29,806 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-14 18:37:29,807 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-14 18:37:29,808 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-14 18:37:29,808 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-14 18:37:29,808 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-14 18:37:29,809 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-14 18:37:29,809 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-14 18:37:29,809 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-14 18:37:29,810 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-14 18:37:29,810 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-14 18:37:29,811 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-14 18:37:29,811 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-14 18:37:29,811 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-14 18:37:29,812 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-14 18:37:29,812 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-14 18:37:29,812 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-14 18:37:29,813 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-14 18:37:29,813 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-14 18:37:29,814 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-14 18:37:29,814 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-14 18:37:29,814 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-14 18:37:29,815 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-14 18:37:29,820 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-14 18:37:29,821 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-14 18:37:29,821 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-14 18:37:29,821 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-14 18:37:29,821 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-14 18:37:29,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {2756#false} assume 4 == ~blastFlag~0; {2756#false} is VALID [2022-04-14 18:37:29,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {2756#false} assume !false; {2756#false} is VALID [2022-04-14 18:37:29,822 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-14 18:37:29,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:37:29,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620364057] [2022-04-14 18:37:29,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620364057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:37:29,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:37:29,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:37:29,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232078317] [2022-04-14 18:37:29,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:37:29,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 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 48 [2022-04-14 18:37:29,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:37:29,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:37:29,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:37:29,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:37:29,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:37:29,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:37:29,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:37:29,859 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:37:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:35,362 INFO L93 Difference]: Finished difference Result 503 states and 800 transitions. [2022-04-14 18:37:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:37:35,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 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 48 [2022-04-14 18:37:35,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:37:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:37:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-14 18:37:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:37:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-14 18:37:35,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-14 18:37:35,763 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-14 18:37:35,768 INFO L225 Difference]: With dead ends: 503 [2022-04-14 18:37:35,768 INFO L226 Difference]: Without dead ends: 319 [2022-04-14 18:37:35,769 INFO L912 BasicCegarLoop]: 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-14 18:37:35,770 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 123 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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, 2.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:37:35,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 344 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 18:37:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-14 18:37:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 239. [2022-04-14 18:37:35,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:37:35,778 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-14 18:37:35,779 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-14 18:37:35,779 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-14 18:37:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:35,786 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-14 18:37:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-14 18:37:35,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:37:35,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:37:35,787 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-14 18:37:35,788 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-14 18:37:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:35,794 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-14 18:37:35,794 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-14 18:37:35,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:37:35,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:37:35,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:37:35,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:37:35,795 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-14 18:37:35,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-14 18:37:35,799 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 48 [2022-04-14 18:37:35,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:37:35,800 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-14 18:37:35,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:37:35,800 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-14 18:37:35,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-14 18:37:35,800 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:37:35,801 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:37:35,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 18:37:35,801 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:37:35,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:37:35,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1906852389, now seen corresponding path program 1 times [2022-04-14 18:37:35,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:37:35,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977144874] [2022-04-14 18:37:35,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:37:35,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:37:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:35,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:37:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:35,906 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {4265#true} is VALID [2022-04-14 18:37:35,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {4265#true} assume true; {4265#true} is VALID [2022-04-14 18:37:35,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4265#true} {4265#true} #690#return; {4265#true} is VALID [2022-04-14 18:37:35,908 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-14 18:37:35,908 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {4265#true} is VALID [2022-04-14 18:37:35,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {4265#true} assume true; {4265#true} is VALID [2022-04-14 18:37:35,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4265#true} {4265#true} #690#return; {4265#true} is VALID [2022-04-14 18:37:35,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {4265#true} call #t~ret161 := main(); {4265#true} is VALID [2022-04-14 18:37:35,908 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-14 18:37:35,908 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-14 18:37:35,908 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-14 18:37:35,910 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-14 18:37:35,911 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-14 18:37:35,911 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-14 18:37:35,912 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-14 18:37:35,912 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-14 18:37:35,912 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-14 18:37:35,913 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-14 18:37:35,913 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-14 18:37:35,913 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-14 18:37:35,914 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-14 18:37:35,914 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-14 18:37:35,914 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-14 18:37:35,915 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-14 18:37:35,915 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-14 18:37:35,915 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-14 18:37:35,916 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-14 18:37:35,916 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-14 18:37:35,917 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-14 18:37:35,917 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-14 18:37:35,917 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-14 18:37:35,918 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-14 18:37:35,918 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-14 18:37:35,918 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-14 18:37:35,919 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-14 18:37:35,919 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-14 18:37:35,919 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-14 18:37:35,920 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-14 18:37:35,920 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-14 18:37:35,920 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-14 18:37:35,921 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-14 18:37:35,921 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-14 18:37:35,922 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-14 18:37:35,922 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-14 18:37:35,922 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-14 18:37:35,923 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-14 18:37:35,923 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-14 18:37:35,923 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-14 18:37:35,924 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-14 18:37:35,924 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-14 18:37:35,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {4266#false} assume 4 == ~blastFlag~0; {4266#false} is VALID [2022-04-14 18:37:35,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {4266#false} assume !false; {4266#false} is VALID [2022-04-14 18:37:35,924 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-14 18:37:35,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:37:35,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977144874] [2022-04-14 18:37:35,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977144874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:37:35,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:37:35,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:37:35,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273822202] [2022-04-14 18:37:35,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:37:35,934 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-14 18:37:35,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:37:35,935 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-14 18:37:35,969 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-14 18:37:35,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:37:35,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:37:35,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:37:35,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:37:35,970 INFO L87 Difference]: Start difference. First operand 239 states and 388 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-14 18:37:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:39,776 INFO L93 Difference]: Finished difference Result 553 states and 890 transitions. [2022-04-14 18:37:39,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:37:39,776 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-14 18:37:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:37:39,776 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-14 18:37:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2022-04-14 18:37:39,781 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-14 18:37:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2022-04-14 18:37:39,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 596 transitions. [2022-04-14 18:37:40,187 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-14 18:37:40,192 INFO L225 Difference]: With dead ends: 553 [2022-04-14 18:37:40,192 INFO L226 Difference]: Without dead ends: 329 [2022-04-14 18:37:40,193 INFO L912 BasicCegarLoop]: 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-14 18:37:40,193 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 122 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-14 18:37:40,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 356 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-14 18:37:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-14 18:37:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 250. [2022-04-14 18:37:40,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:37:40,200 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-14 18:37:40,201 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-14 18:37:40,201 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-14 18:37:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:40,206 INFO L93 Difference]: Finished difference Result 329 states and 520 transitions. [2022-04-14 18:37:40,206 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 520 transitions. [2022-04-14 18:37:40,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:37:40,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:37:40,207 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-14 18:37:40,208 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-14 18:37:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:40,213 INFO L93 Difference]: Finished difference Result 329 states and 520 transitions. [2022-04-14 18:37:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 520 transitions. [2022-04-14 18:37:40,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:37:40,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:37:40,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:37:40,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:37:40,214 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-14 18:37:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 409 transitions. [2022-04-14 18:37:40,218 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 409 transitions. Word has length 49 [2022-04-14 18:37:40,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:37:40,218 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 409 transitions. [2022-04-14 18:37:40,218 INFO L479 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-14 18:37:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 409 transitions. [2022-04-14 18:37:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-14 18:37:40,219 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:37:40,219 INFO L499 BasicCegarLoop]: 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-14 18:37:40,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 18:37:40,219 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:37:40,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:37:40,219 INFO L85 PathProgramCache]: Analyzing trace with hash -16045120, now seen corresponding path program 1 times [2022-04-14 18:37:40,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:37:40,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860163238] [2022-04-14 18:37:40,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:37:40,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:37:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:40,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:37:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:40,327 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {5858#true} is VALID [2022-04-14 18:37:40,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {5858#true} assume true; {5858#true} is VALID [2022-04-14 18:37:40,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5858#true} {5858#true} #690#return; {5858#true} is VALID [2022-04-14 18:37:40,328 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-14 18:37:40,329 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {5858#true} is VALID [2022-04-14 18:37:40,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {5858#true} assume true; {5858#true} is VALID [2022-04-14 18:37:40,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5858#true} {5858#true} #690#return; {5858#true} is VALID [2022-04-14 18:37:40,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {5858#true} call #t~ret161 := main(); {5858#true} is VALID [2022-04-14 18:37:40,329 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-14 18:37:40,329 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-14 18:37:40,329 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-14 18:37:40,331 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-14 18:37:40,331 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-14 18:37:40,332 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-14 18:37:40,332 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-14 18:37:40,333 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-14 18:37:40,333 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-14 18:37:40,333 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-14 18:37:40,334 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-14 18:37:40,334 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-14 18:37:40,334 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-14 18:37:40,335 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-14 18:37:40,335 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-14 18:37:40,335 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-14 18:37:40,336 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-14 18:37:40,336 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-14 18:37:40,336 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-14 18:37:40,337 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-14 18:37:40,337 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-14 18:37:40,337 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-14 18:37:40,337 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-14 18:37:40,337 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-14 18:37:40,337 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-14 18:37:40,337 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-14 18:37:40,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {5859#false} assume 8528 == #t~mem62;havoc #t~mem62; {5859#false} is VALID [2022-04-14 18:37:40,337 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-14 18:37:40,338 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-14 18:37:40,338 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-14 18:37:40,338 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-14 18:37:40,338 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-14 18:37:40,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {5859#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {5859#false} is VALID [2022-04-14 18:37:40,338 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-14 18:37:40,338 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-14 18:37:40,338 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-14 18:37:40,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {5859#false} ~skip~0 := 0; {5859#false} is VALID [2022-04-14 18:37:40,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {5859#false} assume !false; {5859#false} is VALID [2022-04-14 18:37:40,339 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-14 18:37:40,339 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-14 18:37:40,339 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-14 18:37:40,339 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-14 18:37:40,339 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-14 18:37:40,339 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-14 18:37:40,339 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-14 18:37:40,339 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-14 18:37:40,339 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-14 18:37:40,339 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-14 18:37:40,339 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-14 18:37:40,339 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-14 18:37:40,340 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-14 18:37:40,340 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-14 18:37:40,340 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-14 18:37:40,340 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-14 18:37:40,340 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-14 18:37:40,340 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-14 18:37:40,340 INFO L290 TraceCheckUtils]: 61: Hoare triple {5859#false} assume 8544 == #t~mem64;havoc #t~mem64; {5859#false} is VALID [2022-04-14 18:37:40,340 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-14 18:37:40,340 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-14 18:37:40,340 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-14 18:37:40,340 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-14 18:37:40,340 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-14 18:37:40,340 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-14 18:37:40,341 INFO L290 TraceCheckUtils]: 68: Hoare triple {5859#false} assume 8 == ~blastFlag~0; {5859#false} is VALID [2022-04-14 18:37:40,341 INFO L290 TraceCheckUtils]: 69: Hoare triple {5859#false} assume !false; {5859#false} is VALID [2022-04-14 18:37:40,341 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-14 18:37:40,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:37:40,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860163238] [2022-04-14 18:37:40,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860163238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:37:40,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:37:40,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:37:40,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520081902] [2022-04-14 18:37:40,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:37:40,342 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-14 18:37:40,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:37:40,342 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-14 18:37:40,385 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-14 18:37:40,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:37:40,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:37:40,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:37:40,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:37:40,386 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-14 18:37:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:43,977 INFO L93 Difference]: Finished difference Result 513 states and 840 transitions. [2022-04-14 18:37:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:37:43,978 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-14 18:37:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:37:43,978 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-14 18:37:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-14 18:37:43,981 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-14 18:37:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-14 18:37:43,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-14 18:37:44,257 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-14 18:37:44,261 INFO L225 Difference]: With dead ends: 513 [2022-04-14 18:37:44,261 INFO L226 Difference]: Without dead ends: 278 [2022-04-14 18:37:44,261 INFO L912 BasicCegarLoop]: 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-14 18:37:44,262 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:37:44,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 481 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-14 18:37:44,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-14 18:37:44,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 261. [2022-04-14 18:37:44,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:37:44,268 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-14 18:37:44,269 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-14 18:37:44,269 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-14 18:37:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:44,273 INFO L93 Difference]: Finished difference Result 278 states and 449 transitions. [2022-04-14 18:37:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 449 transitions. [2022-04-14 18:37:44,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:37:44,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:37:44,274 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-14 18:37:44,275 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-14 18:37:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:44,279 INFO L93 Difference]: Finished difference Result 278 states and 449 transitions. [2022-04-14 18:37:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 449 transitions. [2022-04-14 18:37:44,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:37:44,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:37:44,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:37:44,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:37:44,280 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-14 18:37:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 428 transitions. [2022-04-14 18:37:44,284 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 428 transitions. Word has length 70 [2022-04-14 18:37:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:37:44,284 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 428 transitions. [2022-04-14 18:37:44,284 INFO L479 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-14 18:37:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 428 transitions. [2022-04-14 18:37:44,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-14 18:37:44,285 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:37:44,285 INFO L499 BasicCegarLoop]: 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-14 18:37:44,285 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-14 18:37:44,285 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:37:44,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:37:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1233059435, now seen corresponding path program 1 times [2022-04-14 18:37:44,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:37:44,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499347435] [2022-04-14 18:37:44,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:37:44,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:37:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:44,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:37:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:44,386 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {7306#true} is VALID [2022-04-14 18:37:44,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {7306#true} assume true; {7306#true} is VALID [2022-04-14 18:37:44,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7306#true} {7306#true} #690#return; {7306#true} is VALID [2022-04-14 18:37:44,387 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-14 18:37:44,387 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {7306#true} is VALID [2022-04-14 18:37:44,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {7306#true} assume true; {7306#true} is VALID [2022-04-14 18:37:44,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7306#true} {7306#true} #690#return; {7306#true} is VALID [2022-04-14 18:37:44,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {7306#true} call #t~ret161 := main(); {7306#true} is VALID [2022-04-14 18:37:44,388 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-14 18:37:44,388 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-14 18:37:44,388 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-14 18:37:44,389 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-14 18:37:44,390 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-14 18:37:44,391 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-14 18:37:44,391 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-14 18:37:44,391 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-14 18:37:44,392 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-14 18:37:44,392 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-14 18:37:44,392 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-14 18:37:44,393 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-14 18:37:44,393 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-14 18:37:44,393 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-14 18:37:44,394 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-14 18:37:44,394 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-14 18:37:44,394 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-14 18:37:44,394 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-14 18:37:44,395 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-14 18:37:44,395 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-14 18:37:44,395 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-14 18:37:44,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {7307#false} ~skip~0 := 0; {7307#false} is VALID [2022-04-14 18:37:44,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {7307#false} assume !false; {7307#false} is VALID [2022-04-14 18:37:44,395 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-14 18:37:44,395 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-14 18:37:44,395 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-14 18:37:44,395 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-14 18:37:44,395 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-14 18:37:44,395 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-14 18:37:44,395 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-14 18:37:44,395 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-14 18:37:44,396 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-14 18:37:44,396 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-14 18:37:44,396 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-14 18:37:44,396 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-14 18:37:44,396 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-14 18:37:44,396 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-14 18:37:44,396 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-14 18:37:44,396 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-14 18:37:44,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {7307#false} assume 8528 == #t~mem62;havoc #t~mem62; {7307#false} is VALID [2022-04-14 18:37:44,396 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-14 18:37:44,396 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-14 18:37:44,396 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-14 18:37:44,396 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-14 18:37:44,397 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-14 18:37:44,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {7307#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {7307#false} is VALID [2022-04-14 18:37:44,397 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-14 18:37:44,397 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-14 18:37:44,397 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-14 18:37:44,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {7307#false} ~skip~0 := 0; {7307#false} is VALID [2022-04-14 18:37:44,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {7307#false} assume !false; {7307#false} is VALID [2022-04-14 18:37:44,397 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-14 18:37:44,397 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-14 18:37:44,397 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-14 18:37:44,397 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-14 18:37:44,397 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-14 18:37:44,397 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-14 18:37:44,397 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-14 18:37:44,398 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-14 18:37:44,398 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-14 18:37:44,398 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-14 18:37:44,398 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-14 18:37:44,398 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-14 18:37:44,398 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-14 18:37:44,398 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-14 18:37:44,398 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-14 18:37:44,398 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-14 18:37:44,398 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-14 18:37:44,398 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-14 18:37:44,398 INFO L290 TraceCheckUtils]: 74: Hoare triple {7307#false} assume 8544 == #t~mem64;havoc #t~mem64; {7307#false} is VALID [2022-04-14 18:37:44,398 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-14 18:37:44,399 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-14 18:37:44,399 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-14 18:37:44,399 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-14 18:37:44,399 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-14 18:37:44,399 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-14 18:37:44,399 INFO L290 TraceCheckUtils]: 81: Hoare triple {7307#false} assume 8 == ~blastFlag~0; {7307#false} is VALID [2022-04-14 18:37:44,399 INFO L290 TraceCheckUtils]: 82: Hoare triple {7307#false} assume !false; {7307#false} is VALID [2022-04-14 18:37:44,399 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-14 18:37:44,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:37:44,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499347435] [2022-04-14 18:37:44,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499347435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:37:44,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:37:44,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:37:44,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627164495] [2022-04-14 18:37:44,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:37:44,400 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-14 18:37:44,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:37:44,401 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-14 18:37:44,446 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-14 18:37:44,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:37:44,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:37:44,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:37:44,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:37:44,447 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-14 18:37:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:49,311 INFO L93 Difference]: Finished difference Result 513 states and 839 transitions. [2022-04-14 18:37:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:37:49,311 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-14 18:37:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:37:49,311 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-14 18:37:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-14 18:37:49,313 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-14 18:37:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-14 18:37:49,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-14 18:37:49,596 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-14 18:37:49,600 INFO L225 Difference]: With dead ends: 513 [2022-04-14 18:37:49,600 INFO L226 Difference]: Without dead ends: 278 [2022-04-14 18:37:49,601 INFO L912 BasicCegarLoop]: 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-14 18:37:49,601 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.6s IncrementalHoareTripleChecker+Time [2022-04-14 18:37:49,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 483 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-14 18:37:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-14 18:37:49,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 261. [2022-04-14 18:37:49,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:37:49,606 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-14 18:37:49,607 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-14 18:37:49,607 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-14 18:37:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:49,611 INFO L93 Difference]: Finished difference Result 278 states and 448 transitions. [2022-04-14 18:37:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 448 transitions. [2022-04-14 18:37:49,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:37:49,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:37:49,612 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-14 18:37:49,613 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-14 18:37:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:49,617 INFO L93 Difference]: Finished difference Result 278 states and 448 transitions. [2022-04-14 18:37:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 448 transitions. [2022-04-14 18:37:49,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:37:49,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:37:49,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:37:49,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:37:49,618 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-14 18:37:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 427 transitions. [2022-04-14 18:37:49,621 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 427 transitions. Word has length 83 [2022-04-14 18:37:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:37:49,621 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 427 transitions. [2022-04-14 18:37:49,622 INFO L479 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-14 18:37:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 427 transitions. [2022-04-14 18:37:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-14 18:37:49,622 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:37:49,622 INFO L499 BasicCegarLoop]: 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-14 18:37:49,622 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-14 18:37:49,623 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:37:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:37:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash -522284645, now seen corresponding path program 1 times [2022-04-14 18:37:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:37:49,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778720456] [2022-04-14 18:37:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:37:49,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:37:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:49,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:37:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:49,723 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {8754#true} is VALID [2022-04-14 18:37:49,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {8754#true} assume true; {8754#true} is VALID [2022-04-14 18:37:49,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8754#true} {8754#true} #690#return; {8754#true} is VALID [2022-04-14 18:37:49,724 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-14 18:37:49,724 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {8754#true} is VALID [2022-04-14 18:37:49,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {8754#true} assume true; {8754#true} is VALID [2022-04-14 18:37:49,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8754#true} {8754#true} #690#return; {8754#true} is VALID [2022-04-14 18:37:49,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {8754#true} call #t~ret161 := main(); {8754#true} is VALID [2022-04-14 18:37:49,724 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-14 18:37:49,724 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-14 18:37:49,724 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-14 18:37:49,726 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-14 18:37:49,726 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-14 18:37:49,727 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-14 18:37:49,727 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-14 18:37:49,728 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-14 18:37:49,728 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-14 18:37:49,728 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-14 18:37:49,728 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-14 18:37:49,729 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-14 18:37:49,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {8755#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {8755#false} is VALID [2022-04-14 18:37:49,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {8755#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {8755#false} is VALID [2022-04-14 18:37:49,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {8755#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {8755#false} is VALID [2022-04-14 18:37:49,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {8755#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8755#false} is VALID [2022-04-14 18:37:49,729 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-14 18:37:49,729 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-14 18:37:49,729 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-14 18:37:49,729 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-14 18:37:49,729 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-14 18:37:49,730 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-14 18:37:49,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {8755#false} ~skip~0 := 0; {8755#false} is VALID [2022-04-14 18:37:49,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {8755#false} assume !false; {8755#false} is VALID [2022-04-14 18:37:49,730 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-14 18:37:49,730 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-14 18:37:49,730 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-14 18:37:49,730 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-14 18:37:49,730 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-14 18:37:49,730 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-14 18:37:49,730 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-14 18:37:49,730 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-14 18:37:49,730 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-14 18:37:49,730 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-14 18:37:49,730 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-14 18:37:49,730 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-14 18:37:49,730 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-14 18:37:49,731 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-14 18:37:49,731 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-14 18:37:49,731 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-14 18:37:49,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {8755#false} assume 8528 == #t~mem62;havoc #t~mem62; {8755#false} is VALID [2022-04-14 18:37:49,731 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-14 18:37:49,731 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-14 18:37:49,731 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-14 18:37:49,731 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-14 18:37:49,731 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-14 18:37:49,731 INFO L290 TraceCheckUtils]: 51: Hoare triple {8755#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {8755#false} is VALID [2022-04-14 18:37:49,731 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-14 18:37:49,731 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-14 18:37:49,731 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-14 18:37:49,731 INFO L290 TraceCheckUtils]: 55: Hoare triple {8755#false} ~skip~0 := 0; {8755#false} is VALID [2022-04-14 18:37:49,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {8755#false} assume !false; {8755#false} is VALID [2022-04-14 18:37:49,731 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,732 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-14 18:37:49,733 INFO L290 TraceCheckUtils]: 75: Hoare triple {8755#false} assume 8544 == #t~mem64;havoc #t~mem64; {8755#false} is VALID [2022-04-14 18:37:49,733 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-14 18:37:49,733 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-14 18:37:49,733 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-14 18:37:49,733 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-14 18:37:49,733 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-14 18:37:49,733 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-14 18:37:49,733 INFO L290 TraceCheckUtils]: 82: Hoare triple {8755#false} assume 8 == ~blastFlag~0; {8755#false} is VALID [2022-04-14 18:37:49,733 INFO L290 TraceCheckUtils]: 83: Hoare triple {8755#false} assume !false; {8755#false} is VALID [2022-04-14 18:37:49,733 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-14 18:37:49,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:37:49,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778720456] [2022-04-14 18:37:49,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778720456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:37:49,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:37:49,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:37:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671746944] [2022-04-14 18:37:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:37:49,734 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-14 18:37:49,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:37:49,734 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-14 18:37:49,780 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-14 18:37:49,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:37:49,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:37:49,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:37:49,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:37:49,780 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-14 18:37:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:54,123 INFO L93 Difference]: Finished difference Result 574 states and 927 transitions. [2022-04-14 18:37:54,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:37:54,124 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-14 18:37:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:37:54,124 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-14 18:37:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-14 18:37:54,128 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-14 18:37:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-14 18:37:54,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 594 transitions. [2022-04-14 18:37:54,528 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-14 18:37:54,534 INFO L225 Difference]: With dead ends: 574 [2022-04-14 18:37:54,534 INFO L226 Difference]: Without dead ends: 339 [2022-04-14 18:37:54,534 INFO L912 BasicCegarLoop]: 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-14 18:37:54,535 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 150 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-14 18:37:54,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 358 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-14 18:37:54,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-14 18:37:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 261. [2022-04-14 18:37:54,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:37:54,540 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-14 18:37:54,540 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-14 18:37:54,541 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-14 18:37:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:54,547 INFO L93 Difference]: Finished difference Result 339 states and 533 transitions. [2022-04-14 18:37:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 533 transitions. [2022-04-14 18:37:54,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:37:54,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:37:54,548 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-14 18:37:54,548 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-14 18:37:54,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:37:54,553 INFO L93 Difference]: Finished difference Result 339 states and 533 transitions. [2022-04-14 18:37:54,553 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 533 transitions. [2022-04-14 18:37:54,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:37:54,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:37:54,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:37:54,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:37:54,554 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-14 18:37:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 423 transitions. [2022-04-14 18:37:54,557 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 423 transitions. Word has length 84 [2022-04-14 18:37:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:37:54,558 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 423 transitions. [2022-04-14 18:37:54,558 INFO L479 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-14 18:37:54,558 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 423 transitions. [2022-04-14 18:37:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-14 18:37:54,560 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:37:54,560 INFO L499 BasicCegarLoop]: 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-14 18:37:54,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-14 18:37:54,561 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:37:54,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:37:54,561 INFO L85 PathProgramCache]: Analyzing trace with hash 725507119, now seen corresponding path program 1 times [2022-04-14 18:37:54,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:37:54,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969992884] [2022-04-14 18:37:54,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:37:54,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:37:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:54,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:37:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:37:54,716 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {10400#true} is VALID [2022-04-14 18:37:54,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {10400#true} assume true; {10400#true} is VALID [2022-04-14 18:37:54,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10400#true} {10400#true} #690#return; {10400#true} is VALID [2022-04-14 18:37:54,718 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-14 18:37:54,718 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {10400#true} is VALID [2022-04-14 18:37:54,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {10400#true} assume true; {10400#true} is VALID [2022-04-14 18:37:54,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10400#true} {10400#true} #690#return; {10400#true} is VALID [2022-04-14 18:37:54,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {10400#true} call #t~ret161 := main(); {10400#true} is VALID [2022-04-14 18:37:54,718 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-14 18:37:54,718 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-14 18:37:54,718 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-14 18:37:54,720 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-14 18:37:54,720 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-14 18:37:54,721 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-14 18:37:54,721 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-14 18:37:54,721 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-14 18:37:54,722 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-14 18:37:54,722 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-14 18:37:54,722 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-14 18:37:54,723 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-14 18:37:54,723 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-14 18:37:54,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {10401#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {10401#false} is VALID [2022-04-14 18:37:54,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {10401#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {10401#false} is VALID [2022-04-14 18:37:54,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {10401#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {10401#false} is VALID [2022-04-14 18:37:54,723 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-14 18:37:54,723 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-14 18:37:54,723 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-14 18:37:54,723 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-14 18:37:54,723 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-14 18:37:54,723 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-14 18:37:54,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {10401#false} ~skip~0 := 0; {10401#false} is VALID [2022-04-14 18:37:54,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {10401#false} assume !false; {10401#false} is VALID [2022-04-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 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-14 18:37:54,724 INFO L290 TraceCheckUtils]: 45: Hoare triple {10401#false} assume 8528 == #t~mem62;havoc #t~mem62; {10401#false} is VALID [2022-04-14 18:37:54,725 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-14 18:37:54,725 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-14 18:37:54,725 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-14 18:37:54,725 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-14 18:37:54,725 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-14 18:37:54,725 INFO L290 TraceCheckUtils]: 51: Hoare triple {10401#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {10401#false} is VALID [2022-04-14 18:37:54,725 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-14 18:37:54,725 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-14 18:37:54,725 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-14 18:37:54,725 INFO L290 TraceCheckUtils]: 55: Hoare triple {10401#false} ~skip~0 := 0; {10401#false} is VALID [2022-04-14 18:37:54,725 INFO L290 TraceCheckUtils]: 56: Hoare triple {10401#false} assume !false; {10401#false} is VALID [2022-04-14 18:37:54,725 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-14 18:37:54,725 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-14 18:37:54,727 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-14 18:37:54,727 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-14 18:37:54,728 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-14 18:37:54,728 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-14 18:37:54,728 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-14 18:37:54,728 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-14 18:37:54,728 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-14 18:37:54,728 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-14 18:37:54,730 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-14 18:37:54,731 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-14 18:37:54,732 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-14 18:37:54,732 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-14 18:37:54,732 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-14 18:37:54,732 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-14 18:37:54,732 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-14 18:37:54,732 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-14 18:37:54,732 INFO L290 TraceCheckUtils]: 75: Hoare triple {10401#false} assume 8544 == #t~mem64;havoc #t~mem64; {10401#false} is VALID [2022-04-14 18:37:54,732 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-14 18:37:54,733 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-14 18:37:54,733 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-14 18:37:54,733 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-14 18:37:54,733 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-14 18:37:54,733 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-14 18:37:54,733 INFO L290 TraceCheckUtils]: 82: Hoare triple {10401#false} assume 8 == ~blastFlag~0; {10401#false} is VALID [2022-04-14 18:37:54,733 INFO L290 TraceCheckUtils]: 83: Hoare triple {10401#false} assume !false; {10401#false} is VALID [2022-04-14 18:37:54,733 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-14 18:37:54,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:37:54,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969992884] [2022-04-14 18:37:54,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969992884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:37:54,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:37:54,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:37:54,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156297640] [2022-04-14 18:37:54,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:37:54,734 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-14 18:37:54,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:37:54,734 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-14 18:37:54,774 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-14 18:37:54,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:37:54,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:37:54,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:37:54,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:37:54,775 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-14 18:37:58,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:38:00,167 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-14 18:38:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:01,903 INFO L93 Difference]: Finished difference Result 574 states and 920 transitions. [2022-04-14 18:38:01,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:38:01,903 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-14 18:38:01,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:38:01,904 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-14 18:38:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-14 18:38:01,918 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-14 18:38:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-14 18:38:01,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-14 18:38:02,314 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-14 18:38:02,319 INFO L225 Difference]: With dead ends: 574 [2022-04-14 18:38:02,319 INFO L226 Difference]: Without dead ends: 339 [2022-04-14 18:38:02,319 INFO L912 BasicCegarLoop]: 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-14 18:38:02,320 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 148 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-14 18:38:02,320 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 358 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 481 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-04-14 18:38:02,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-14 18:38:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 261. [2022-04-14 18:38:02,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:38:02,325 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-14 18:38:02,325 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-14 18:38:02,326 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-14 18:38:02,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:02,331 INFO L93 Difference]: Finished difference Result 339 states and 529 transitions. [2022-04-14 18:38:02,331 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 529 transitions. [2022-04-14 18:38:02,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:02,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:02,332 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-14 18:38:02,332 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-14 18:38:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:02,337 INFO L93 Difference]: Finished difference Result 339 states and 529 transitions. [2022-04-14 18:38:02,337 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 529 transitions. [2022-04-14 18:38:02,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:02,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:02,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:38:02,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:38:02,338 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-14 18:38:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 419 transitions. [2022-04-14 18:38:02,341 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 419 transitions. Word has length 84 [2022-04-14 18:38:02,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:38:02,342 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 419 transitions. [2022-04-14 18:38:02,342 INFO L479 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-14 18:38:02,342 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 419 transitions. [2022-04-14 18:38:02,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-14 18:38:02,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:38:02,342 INFO L499 BasicCegarLoop]: 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-14 18:38:02,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-14 18:38:02,343 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:38:02,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:38:02,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1148494374, now seen corresponding path program 1 times [2022-04-14 18:38:02,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:38:02,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197295751] [2022-04-14 18:38:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:38:02,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:38:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:02,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:38:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:02,439 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {12046#true} is VALID [2022-04-14 18:38:02,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {12046#true} assume true; {12046#true} is VALID [2022-04-14 18:38:02,439 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12046#true} {12046#true} #690#return; {12046#true} is VALID [2022-04-14 18:38:02,440 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-14 18:38:02,440 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {12046#true} is VALID [2022-04-14 18:38:02,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {12046#true} assume true; {12046#true} is VALID [2022-04-14 18:38:02,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12046#true} {12046#true} #690#return; {12046#true} is VALID [2022-04-14 18:38:02,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {12046#true} call #t~ret161 := main(); {12046#true} is VALID [2022-04-14 18:38:02,440 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-14 18:38:02,440 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-14 18:38:02,440 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-14 18:38:02,442 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-14 18:38:02,442 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-14 18:38:02,443 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-14 18:38:02,443 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-14 18:38:02,444 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-14 18:38:02,444 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-14 18:38:02,444 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-14 18:38:02,445 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-14 18:38:02,445 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-14 18:38:02,445 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-14 18:38:02,445 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-14 18:38:02,446 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-14 18:38:02,446 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-14 18:38:02,446 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-14 18:38:02,447 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-14 18:38:02,447 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-14 18:38:02,447 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-14 18:38:02,447 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-14 18:38:02,447 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-14 18:38:02,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {12047#false} ~skip~0 := 0; {12047#false} is VALID [2022-04-14 18:38:02,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {12047#false} assume !false; {12047#false} is VALID [2022-04-14 18:38:02,447 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-14 18:38:02,447 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-14 18:38:02,447 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-14 18:38:02,447 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-14 18:38:02,447 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-14 18:38:02,447 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-14 18:38:02,447 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-14 18:38:02,447 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-14 18:38:02,448 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-14 18:38:02,448 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-14 18:38:02,448 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-14 18:38:02,448 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-14 18:38:02,448 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-14 18:38:02,448 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-14 18:38:02,448 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-14 18:38:02,448 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-14 18:38:02,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {12047#false} assume 8528 == #t~mem62;havoc #t~mem62; {12047#false} is VALID [2022-04-14 18:38:02,448 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-14 18:38:02,448 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-14 18:38:02,448 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-14 18:38:02,448 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-14 18:38:02,448 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-14 18:38:02,448 INFO L290 TraceCheckUtils]: 51: Hoare triple {12047#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {12047#false} is VALID [2022-04-14 18:38:02,448 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-14 18:38:02,448 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-14 18:38:02,448 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-14 18:38:02,448 INFO L290 TraceCheckUtils]: 55: Hoare triple {12047#false} ~skip~0 := 0; {12047#false} is VALID [2022-04-14 18:38:02,449 INFO L290 TraceCheckUtils]: 56: Hoare triple {12047#false} assume !false; {12047#false} is VALID [2022-04-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 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-14 18:38:02,449 INFO L290 TraceCheckUtils]: 75: Hoare triple {12047#false} assume 8544 == #t~mem64;havoc #t~mem64; {12047#false} is VALID [2022-04-14 18:38:02,450 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-14 18:38:02,450 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-14 18:38:02,450 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-14 18:38:02,450 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-14 18:38:02,450 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-14 18:38:02,450 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-14 18:38:02,450 INFO L290 TraceCheckUtils]: 82: Hoare triple {12047#false} assume 8 == ~blastFlag~0; {12047#false} is VALID [2022-04-14 18:38:02,450 INFO L290 TraceCheckUtils]: 83: Hoare triple {12047#false} assume !false; {12047#false} is VALID [2022-04-14 18:38:02,450 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-14 18:38:02,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:38:02,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197295751] [2022-04-14 18:38:02,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197295751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:38:02,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:38:02,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:38:02,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901697495] [2022-04-14 18:38:02,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:38:02,451 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-14 18:38:02,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:38:02,451 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-14 18:38:02,497 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-14 18:38:02,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:38:02,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:38:02,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:38:02,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:38:02,498 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-14 18:38:06,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:06,511 INFO L93 Difference]: Finished difference Result 510 states and 821 transitions. [2022-04-14 18:38:06,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:38:06,512 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-14 18:38:06,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:38:06,512 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-14 18:38:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-14 18:38:06,514 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-14 18:38:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-14 18:38:06,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-14 18:38:06,816 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-14 18:38:06,820 INFO L225 Difference]: With dead ends: 510 [2022-04-14 18:38:06,820 INFO L226 Difference]: Without dead ends: 275 [2022-04-14 18:38:06,820 INFO L912 BasicCegarLoop]: 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-14 18:38:06,821 INFO L913 BasicCegarLoop]: 190 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-14 18:38:06,821 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-14 18:38:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-14 18:38:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2022-04-14 18:38:06,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:38:06,825 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-14 18:38:06,825 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-14 18:38:06,826 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-14 18:38:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:06,829 INFO L93 Difference]: Finished difference Result 275 states and 436 transitions. [2022-04-14 18:38:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 436 transitions. [2022-04-14 18:38:06,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:06,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:06,830 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-14 18:38:06,830 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-14 18:38:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:06,833 INFO L93 Difference]: Finished difference Result 275 states and 436 transitions. [2022-04-14 18:38:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 436 transitions. [2022-04-14 18:38:06,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:06,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:06,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:38:06,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:38:06,834 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-14 18:38:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 418 transitions. [2022-04-14 18:38:06,837 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 418 transitions. Word has length 84 [2022-04-14 18:38:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:38:06,837 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 418 transitions. [2022-04-14 18:38:06,838 INFO L479 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-14 18:38:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 418 transitions. [2022-04-14 18:38:06,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-14 18:38:06,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:38:06,838 INFO L499 BasicCegarLoop]: 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-14 18:38:06,838 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-14 18:38:06,838 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:38:06,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:38:06,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1158470119, now seen corresponding path program 1 times [2022-04-14 18:38:06,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:38:06,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755017816] [2022-04-14 18:38:06,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:38:06,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:38:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:06,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:38:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:06,943 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {13483#true} is VALID [2022-04-14 18:38:06,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {13483#true} assume true; {13483#true} is VALID [2022-04-14 18:38:06,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13483#true} {13483#true} #690#return; {13483#true} is VALID [2022-04-14 18:38:06,944 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-14 18:38:06,944 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {13483#true} is VALID [2022-04-14 18:38:06,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {13483#true} assume true; {13483#true} is VALID [2022-04-14 18:38:06,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13483#true} {13483#true} #690#return; {13483#true} is VALID [2022-04-14 18:38:06,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {13483#true} call #t~ret161 := main(); {13483#true} is VALID [2022-04-14 18:38:06,944 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-14 18:38:06,944 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-14 18:38:06,944 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-14 18:38:06,946 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-14 18:38:06,946 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-14 18:38:06,947 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-14 18:38:06,947 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-14 18:38:06,949 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-14 18:38:06,949 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-14 18:38:06,950 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-14 18:38:06,950 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-14 18:38:06,950 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-14 18:38:06,951 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-14 18:38:06,951 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-14 18:38:06,951 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-14 18:38:06,951 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-14 18:38:06,952 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-14 18:38:06,952 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-14 18:38:06,952 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-14 18:38:06,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {13484#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-14 18:38:06,952 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-14 18:38:06,953 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-14 18:38:06,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {13484#false} ~skip~0 := 0; {13484#false} is VALID [2022-04-14 18:38:06,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {13484#false} assume !false; {13484#false} is VALID [2022-04-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 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-14 18:38:06,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {13484#false} assume 8528 == #t~mem62;havoc #t~mem62; {13484#false} is VALID [2022-04-14 18:38:06,954 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-14 18:38:06,954 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-14 18:38:06,954 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-14 18:38:06,954 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-14 18:38:06,954 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-14 18:38:06,954 INFO L290 TraceCheckUtils]: 51: Hoare triple {13484#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {13484#false} is VALID [2022-04-14 18:38:06,954 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-14 18:38:06,954 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-14 18:38:06,954 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-14 18:38:06,954 INFO L290 TraceCheckUtils]: 55: Hoare triple {13484#false} ~skip~0 := 0; {13484#false} is VALID [2022-04-14 18:38:06,954 INFO L290 TraceCheckUtils]: 56: Hoare triple {13484#false} assume !false; {13484#false} is VALID [2022-04-14 18:38:06,954 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-14 18:38:06,954 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-14 18:38:06,956 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-14 18:38:06,956 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-14 18:38:06,956 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-14 18:38:06,956 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-14 18:38:06,956 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-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 INFO L290 TraceCheckUtils]: 75: Hoare triple {13484#false} assume 8544 == #t~mem64;havoc #t~mem64; {13484#false} is VALID [2022-04-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 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-14 18:38:06,957 INFO L290 TraceCheckUtils]: 82: Hoare triple {13484#false} assume 8 == ~blastFlag~0; {13484#false} is VALID [2022-04-14 18:38:06,957 INFO L290 TraceCheckUtils]: 83: Hoare triple {13484#false} assume !false; {13484#false} is VALID [2022-04-14 18:38:06,958 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-14 18:38:06,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:38:06,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755017816] [2022-04-14 18:38:06,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755017816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:38:06,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:38:06,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:38:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767879913] [2022-04-14 18:38:06,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:38:06,959 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-14 18:38:06,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:38:06,959 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-14 18:38:07,005 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-14 18:38:07,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:38:07,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:38:07,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:38:07,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:38:07,007 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-14 18:38:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:13,433 INFO L93 Difference]: Finished difference Result 573 states and 911 transitions. [2022-04-14 18:38:13,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:38:13,433 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-14 18:38:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:38:13,433 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-14 18:38:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-14 18:38:13,444 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-14 18:38:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-14 18:38:13,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-14 18:38:13,804 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-14 18:38:13,809 INFO L225 Difference]: With dead ends: 573 [2022-04-14 18:38:13,809 INFO L226 Difference]: Without dead ends: 338 [2022-04-14 18:38:13,810 INFO L912 BasicCegarLoop]: 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-14 18:38:13,810 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 141 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-14 18:38:13,810 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 360 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-14 18:38:13,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-14 18:38:13,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 261. [2022-04-14 18:38:13,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:38:13,814 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-14 18:38:13,815 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-14 18:38:13,815 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-14 18:38:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:13,819 INFO L93 Difference]: Finished difference Result 338 states and 523 transitions. [2022-04-14 18:38:13,819 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 523 transitions. [2022-04-14 18:38:13,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:13,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:13,820 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-14 18:38:13,820 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-14 18:38:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:13,825 INFO L93 Difference]: Finished difference Result 338 states and 523 transitions. [2022-04-14 18:38:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 523 transitions. [2022-04-14 18:38:13,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:13,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:13,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:38:13,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:38:13,825 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-14 18:38:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 414 transitions. [2022-04-14 18:38:13,828 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 414 transitions. Word has length 84 [2022-04-14 18:38:13,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:38:13,828 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 414 transitions. [2022-04-14 18:38:13,829 INFO L479 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-14 18:38:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 414 transitions. [2022-04-14 18:38:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-14 18:38:13,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:38:13,829 INFO L499 BasicCegarLoop]: 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-14 18:38:13,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-14 18:38:13,829 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:38:13,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:38:13,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1113618796, now seen corresponding path program 1 times [2022-04-14 18:38:13,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:38:13,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478667019] [2022-04-14 18:38:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:38:13,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:38:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:13,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:38:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:13,922 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {15125#true} is VALID [2022-04-14 18:38:13,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {15125#true} assume true; {15125#true} is VALID [2022-04-14 18:38:13,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15125#true} {15125#true} #690#return; {15125#true} is VALID [2022-04-14 18:38:13,923 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-14 18:38:13,923 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {15125#true} is VALID [2022-04-14 18:38:13,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {15125#true} assume true; {15125#true} is VALID [2022-04-14 18:38:13,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15125#true} {15125#true} #690#return; {15125#true} is VALID [2022-04-14 18:38:13,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {15125#true} call #t~ret161 := main(); {15125#true} is VALID [2022-04-14 18:38:13,923 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-14 18:38:13,923 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-14 18:38:13,923 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-14 18:38:13,925 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-14 18:38:13,925 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-14 18:38:13,926 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-14 18:38:13,926 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-14 18:38:13,926 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-14 18:38:13,927 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-14 18:38:13,927 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-14 18:38:13,927 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-14 18:38:13,927 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-14 18:38:13,928 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-14 18:38:13,928 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-14 18:38:13,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {15126#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {15126#false} is VALID [2022-04-14 18:38:13,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {15126#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15126#false} is VALID [2022-04-14 18:38:13,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {15126#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {15126#false} is VALID [2022-04-14 18:38:13,928 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-14 18:38:13,928 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-14 18:38:13,928 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-14 18:38:13,928 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-14 18:38:13,928 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-14 18:38:13,929 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-14 18:38:13,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {15126#false} ~skip~0 := 0; {15126#false} is VALID [2022-04-14 18:38:13,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {15126#false} assume !false; {15126#false} is VALID [2022-04-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 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-14 18:38:13,929 INFO L290 TraceCheckUtils]: 46: Hoare triple {15126#false} assume 8528 == #t~mem62;havoc #t~mem62; {15126#false} is VALID [2022-04-14 18:38:13,929 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-14 18:38:13,930 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-14 18:38:13,930 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-14 18:38:13,930 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-14 18:38:13,930 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-14 18:38:13,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {15126#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {15126#false} is VALID [2022-04-14 18:38:13,930 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-14 18:38:13,930 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-14 18:38:13,930 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-14 18:38:13,930 INFO L290 TraceCheckUtils]: 56: Hoare triple {15126#false} ~skip~0 := 0; {15126#false} is VALID [2022-04-14 18:38:13,930 INFO L290 TraceCheckUtils]: 57: Hoare triple {15126#false} assume !false; {15126#false} is VALID [2022-04-14 18:38:13,930 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-14 18:38:13,930 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-14 18:38:13,930 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-14 18:38:13,930 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-14 18:38:13,930 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-14 18:38:13,930 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-14 18:38:13,930 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-14 18:38:13,930 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-14 18:38:13,930 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-14 18:38:13,930 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-14 18:38:13,931 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-14 18:38:13,931 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-14 18:38:13,931 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-14 18:38:13,931 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-14 18:38:13,931 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-14 18:38:13,931 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-14 18:38:13,931 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-14 18:38:13,931 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-14 18:38:13,931 INFO L290 TraceCheckUtils]: 76: Hoare triple {15126#false} assume 8544 == #t~mem64;havoc #t~mem64; {15126#false} is VALID [2022-04-14 18:38:13,931 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-14 18:38:13,931 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-14 18:38:13,931 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-14 18:38:13,931 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-14 18:38:13,931 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-14 18:38:13,931 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-14 18:38:13,931 INFO L290 TraceCheckUtils]: 83: Hoare triple {15126#false} assume 8 == ~blastFlag~0; {15126#false} is VALID [2022-04-14 18:38:13,931 INFO L290 TraceCheckUtils]: 84: Hoare triple {15126#false} assume !false; {15126#false} is VALID [2022-04-14 18:38:13,932 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-14 18:38:13,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:38:13,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478667019] [2022-04-14 18:38:13,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478667019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:38:13,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:38:13,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:38:13,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015965729] [2022-04-14 18:38:13,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:38:13,932 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-14 18:38:13,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:38:13,933 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-14 18:38:13,976 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-14 18:38:13,976 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:38:13,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:38:13,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:38:13,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:38:13,977 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-14 18:38:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:19,626 INFO L93 Difference]: Finished difference Result 509 states and 812 transitions. [2022-04-14 18:38:19,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:38:19,626 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-14 18:38:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:38:19,626 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-14 18:38:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-14 18:38:19,628 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-14 18:38:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-14 18:38:19,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-14 18:38:19,879 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-14 18:38:19,891 INFO L225 Difference]: With dead ends: 509 [2022-04-14 18:38:19,891 INFO L226 Difference]: Without dead ends: 274 [2022-04-14 18:38:19,892 INFO L912 BasicCegarLoop]: 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-14 18:38:19,892 INFO L913 BasicCegarLoop]: 191 mSDtfsCounter, 22 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:38:19,892 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 491 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-14 18:38:19,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-04-14 18:38:19,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 261. [2022-04-14 18:38:19,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:38:19,896 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-14 18:38:19,897 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-14 18:38:19,897 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-14 18:38:19,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:19,900 INFO L93 Difference]: Finished difference Result 274 states and 430 transitions. [2022-04-14 18:38:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 430 transitions. [2022-04-14 18:38:19,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:19,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:19,901 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-14 18:38:19,901 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-14 18:38:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:19,904 INFO L93 Difference]: Finished difference Result 274 states and 430 transitions. [2022-04-14 18:38:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 430 transitions. [2022-04-14 18:38:19,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:19,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:19,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:38:19,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:38:19,905 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-14 18:38:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 413 transitions. [2022-04-14 18:38:19,908 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 413 transitions. Word has length 85 [2022-04-14 18:38:19,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:38:19,908 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 413 transitions. [2022-04-14 18:38:19,908 INFO L479 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-14 18:38:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 413 transitions. [2022-04-14 18:38:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-14 18:38:19,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:38:19,909 INFO L499 BasicCegarLoop]: 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-14 18:38:19,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-14 18:38:19,909 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:38:19,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:38:19,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1037364332, now seen corresponding path program 1 times [2022-04-14 18:38:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:38:19,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26002140] [2022-04-14 18:38:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:38:19,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:38:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:20,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:38:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:20,010 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {16558#true} is VALID [2022-04-14 18:38:20,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {16558#true} assume true; {16558#true} is VALID [2022-04-14 18:38:20,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16558#true} {16558#true} #690#return; {16558#true} is VALID [2022-04-14 18:38:20,011 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-14 18:38:20,011 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {16558#true} is VALID [2022-04-14 18:38:20,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {16558#true} assume true; {16558#true} is VALID [2022-04-14 18:38:20,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16558#true} {16558#true} #690#return; {16558#true} is VALID [2022-04-14 18:38:20,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {16558#true} call #t~ret161 := main(); {16558#true} is VALID [2022-04-14 18:38:20,011 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-14 18:38:20,012 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-14 18:38:20,012 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-14 18:38:20,013 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-14 18:38:20,014 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-14 18:38:20,014 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-14 18:38:20,015 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-14 18:38:20,015 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-14 18:38:20,015 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-14 18:38:20,016 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-14 18:38:20,016 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-14 18:38:20,016 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-14 18:38:20,016 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-14 18:38:20,017 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-14 18:38:20,017 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-14 18:38:20,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {16559#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16559#false} is VALID [2022-04-14 18:38:20,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {16559#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16559#false} is VALID [2022-04-14 18:38:20,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {16559#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16559#false} is VALID [2022-04-14 18:38:20,017 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-14 18:38:20,017 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-14 18:38:20,017 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-14 18:38:20,017 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-14 18:38:20,023 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-14 18:38:20,023 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-14 18:38:20,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {16559#false} ~skip~0 := 0; {16559#false} is VALID [2022-04-14 18:38:20,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {16559#false} assume !false; {16559#false} is VALID [2022-04-14 18:38:20,023 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-14 18:38:20,023 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 INFO L290 TraceCheckUtils]: 47: Hoare triple {16559#false} assume 8528 == #t~mem62;havoc #t~mem62; {16559#false} is VALID [2022-04-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,024 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-14 18:38:20,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {16559#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {16559#false} is VALID [2022-04-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {16559#false} ~skip~0 := 0; {16559#false} is VALID [2022-04-14 18:38:20,025 INFO L290 TraceCheckUtils]: 58: Hoare triple {16559#false} assume !false; {16559#false} is VALID [2022-04-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,025 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-14 18:38:20,026 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-14 18:38:20,026 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-14 18:38:20,026 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-14 18:38:20,026 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-14 18:38:20,026 INFO L290 TraceCheckUtils]: 77: Hoare triple {16559#false} assume 8544 == #t~mem64;havoc #t~mem64; {16559#false} is VALID [2022-04-14 18:38:20,026 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-14 18:38:20,026 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-14 18:38:20,026 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-14 18:38:20,026 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-14 18:38:20,026 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-14 18:38:20,026 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-14 18:38:20,026 INFO L290 TraceCheckUtils]: 84: Hoare triple {16559#false} assume 8 == ~blastFlag~0; {16559#false} is VALID [2022-04-14 18:38:20,026 INFO L290 TraceCheckUtils]: 85: Hoare triple {16559#false} assume !false; {16559#false} is VALID [2022-04-14 18:38:20,026 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-14 18:38:20,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:38:20,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26002140] [2022-04-14 18:38:20,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26002140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:38:20,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:38:20,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:38:20,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356545533] [2022-04-14 18:38:20,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:38:20,027 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-14 18:38:20,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:38:20,027 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-14 18:38:20,076 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-14 18:38:20,077 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:38:20,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:38:20,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:38:20,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:38:20,078 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-14 18:38:23,061 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-14 18:38:26,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:26,172 INFO L93 Difference]: Finished difference Result 573 states and 903 transitions. [2022-04-14 18:38:26,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:38:26,172 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-14 18:38:26,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:38:26,172 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-14 18:38:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-14 18:38:26,182 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-14 18:38:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-14 18:38:26,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-14 18:38:26,550 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-14 18:38:26,555 INFO L225 Difference]: With dead ends: 573 [2022-04-14 18:38:26,555 INFO L226 Difference]: Without dead ends: 338 [2022-04-14 18:38:26,555 INFO L912 BasicCegarLoop]: 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-14 18:38:26,556 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 144 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:38:26,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 360 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-14 18:38:26,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-14 18:38:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 261. [2022-04-14 18:38:26,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:38:26,561 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-14 18:38:26,561 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-14 18:38:26,561 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-14 18:38:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:26,565 INFO L93 Difference]: Finished difference Result 338 states and 518 transitions. [2022-04-14 18:38:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 518 transitions. [2022-04-14 18:38:26,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:26,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:26,566 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-14 18:38:26,566 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-14 18:38:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:26,571 INFO L93 Difference]: Finished difference Result 338 states and 518 transitions. [2022-04-14 18:38:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 518 transitions. [2022-04-14 18:38:26,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:26,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:26,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:38:26,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:38:26,572 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-14 18:38:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 409 transitions. [2022-04-14 18:38:26,575 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 409 transitions. Word has length 86 [2022-04-14 18:38:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:38:26,575 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 409 transitions. [2022-04-14 18:38:26,575 INFO L479 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-14 18:38:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 409 transitions. [2022-04-14 18:38:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-14 18:38:26,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:38:26,576 INFO L499 BasicCegarLoop]: 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-14 18:38:26,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-14 18:38:26,576 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:38:26,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:38:26,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1713860263, now seen corresponding path program 1 times [2022-04-14 18:38:26,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:38:26,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647032692] [2022-04-14 18:38:26,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:38:26,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:38:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:26,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:38:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:26,667 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {18200#true} is VALID [2022-04-14 18:38:26,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {18200#true} assume true; {18200#true} is VALID [2022-04-14 18:38:26,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18200#true} {18200#true} #690#return; {18200#true} is VALID [2022-04-14 18:38:26,668 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-14 18:38:26,668 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {18200#true} is VALID [2022-04-14 18:38:26,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {18200#true} assume true; {18200#true} is VALID [2022-04-14 18:38:26,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18200#true} {18200#true} #690#return; {18200#true} is VALID [2022-04-14 18:38:26,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {18200#true} call #t~ret161 := main(); {18200#true} is VALID [2022-04-14 18:38:26,668 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-14 18:38:26,668 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-14 18:38:26,668 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-14 18:38:26,670 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-14 18:38:26,670 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-14 18:38:26,671 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-14 18:38:26,671 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-14 18:38:26,672 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-14 18:38:26,672 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-14 18:38:26,672 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-14 18:38:26,672 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-14 18:38:26,673 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-14 18:38:26,673 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-14 18:38:26,673 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-14 18:38:26,674 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-14 18:38:26,674 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-14 18:38:26,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {18201#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {18201#false} is VALID [2022-04-14 18:38:26,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {18201#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18201#false} is VALID [2022-04-14 18:38:26,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {18201#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18201#false} is VALID [2022-04-14 18:38:26,674 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-14 18:38:26,674 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-14 18:38:26,674 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-14 18:38:26,674 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-14 18:38:26,674 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-14 18:38:26,675 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-14 18:38:26,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {18201#false} ~skip~0 := 0; {18201#false} is VALID [2022-04-14 18:38:26,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {18201#false} assume !false; {18201#false} is VALID [2022-04-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,675 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-14 18:38:26,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {18201#false} assume 8528 == #t~mem62;havoc #t~mem62; {18201#false} is VALID [2022-04-14 18:38:26,676 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-14 18:38:26,676 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-14 18:38:26,676 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-14 18:38:26,676 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-14 18:38:26,676 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-14 18:38:26,676 INFO L290 TraceCheckUtils]: 54: Hoare triple {18201#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {18201#false} is VALID [2022-04-14 18:38:26,676 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-14 18:38:26,676 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-14 18:38:26,676 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-14 18:38:26,676 INFO L290 TraceCheckUtils]: 58: Hoare triple {18201#false} ~skip~0 := 0; {18201#false} is VALID [2022-04-14 18:38:26,676 INFO L290 TraceCheckUtils]: 59: Hoare triple {18201#false} assume !false; {18201#false} is VALID [2022-04-14 18:38:26,676 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-14 18:38:26,676 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-14 18:38:26,676 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-14 18:38:26,676 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-14 18:38:26,676 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-14 18:38:26,676 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-14 18:38:26,676 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-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 INFO L290 TraceCheckUtils]: 78: Hoare triple {18201#false} assume 8544 == #t~mem64;havoc #t~mem64; {18201#false} is VALID [2022-04-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 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-14 18:38:26,677 INFO L290 TraceCheckUtils]: 85: Hoare triple {18201#false} assume 8 == ~blastFlag~0; {18201#false} is VALID [2022-04-14 18:38:26,677 INFO L290 TraceCheckUtils]: 86: Hoare triple {18201#false} assume !false; {18201#false} is VALID [2022-04-14 18:38:26,678 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-14 18:38:26,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:38:26,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647032692] [2022-04-14 18:38:26,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647032692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:38:26,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:38:26,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:38:26,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474563767] [2022-04-14 18:38:26,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:38:26,679 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-14 18:38:26,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:38:26,679 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-14 18:38:26,727 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-14 18:38:26,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:38:26,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:38:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:38:26,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:38:26,728 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-14 18:38:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:31,268 INFO L93 Difference]: Finished difference Result 499 states and 791 transitions. [2022-04-14 18:38:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:38:31,269 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-14 18:38:31,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:38:31,269 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-14 18:38:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-14 18:38:31,271 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-14 18:38:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-14 18:38:31,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-14 18:38:31,535 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-14 18:38:31,545 INFO L225 Difference]: With dead ends: 499 [2022-04-14 18:38:31,545 INFO L226 Difference]: Without dead ends: 264 [2022-04-14 18:38:31,549 INFO L912 BasicCegarLoop]: 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-14 18:38:31,550 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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, 2.7s IncrementalHoareTripleChecker+Time [2022-04-14 18:38:31,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-14 18:38:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-14 18:38:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2022-04-14 18:38:31,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:38:31,554 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-14 18:38:31,554 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-14 18:38:31,554 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-14 18:38:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:31,557 INFO L93 Difference]: Finished difference Result 264 states and 412 transitions. [2022-04-14 18:38:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 412 transitions. [2022-04-14 18:38:31,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:31,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:31,558 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-14 18:38:31,558 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-14 18:38:31,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:31,562 INFO L93 Difference]: Finished difference Result 264 states and 412 transitions. [2022-04-14 18:38:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 412 transitions. [2022-04-14 18:38:31,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:31,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:31,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:38:31,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:38:31,563 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-14 18:38:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 408 transitions. [2022-04-14 18:38:31,566 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 408 transitions. Word has length 87 [2022-04-14 18:38:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:38:31,566 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 408 transitions. [2022-04-14 18:38:31,566 INFO L479 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-14 18:38:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 408 transitions. [2022-04-14 18:38:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-14 18:38:31,567 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:38:31,567 INFO L499 BasicCegarLoop]: 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-14 18:38:31,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-14 18:38:31,567 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:38:31,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:38:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1127555326, now seen corresponding path program 1 times [2022-04-14 18:38:31,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:38:31,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238396737] [2022-04-14 18:38:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:38:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:38:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:31,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:38:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:31,669 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {19602#true} is VALID [2022-04-14 18:38:31,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {19602#true} assume true; {19602#true} is VALID [2022-04-14 18:38:31,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19602#true} {19602#true} #690#return; {19602#true} is VALID [2022-04-14 18:38:31,669 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-14 18:38:31,670 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {19602#true} is VALID [2022-04-14 18:38:31,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {19602#true} assume true; {19602#true} is VALID [2022-04-14 18:38:31,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19602#true} {19602#true} #690#return; {19602#true} is VALID [2022-04-14 18:38:31,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {19602#true} call #t~ret161 := main(); {19602#true} is VALID [2022-04-14 18:38:31,670 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-14 18:38:31,670 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-14 18:38:31,670 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-14 18:38:31,670 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-14 18:38:31,670 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-14 18:38:31,670 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-14 18:38:31,670 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-14 18:38:31,670 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-14 18:38:31,670 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-14 18:38:31,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {19602#true} assume !false; {19602#true} is VALID [2022-04-14 18:38:31,670 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-14 18:38:31,670 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-14 18:38:31,670 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-14 18:38:31,670 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-14 18:38:31,671 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-14 18:38:31,671 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-14 18:38:31,671 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-14 18:38:31,671 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-14 18:38:31,671 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-14 18:38:31,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {19602#true} assume 8464 == #t~mem55;havoc #t~mem55; {19602#true} is VALID [2022-04-14 18:38:31,671 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-14 18:38:31,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {19602#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19602#true} is VALID [2022-04-14 18:38:31,672 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-14 18:38:31,672 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-14 18:38:31,673 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-14 18:38:31,673 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-14 18:38:31,673 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-14 18:38:31,674 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-14 18:38:31,674 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-14 18:38:31,674 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-14 18:38:31,675 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-14 18:38:31,675 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-14 18:38:31,675 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-14 18:38:31,675 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-14 18:38:31,676 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-14 18:38:31,676 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-14 18:38:31,676 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-14 18:38:31,677 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-14 18:38:31,677 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-14 18:38:31,677 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-14 18:38:31,677 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-14 18:38:31,677 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-14 18:38:31,677 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-14 18:38:31,677 INFO L290 TraceCheckUtils]: 48: Hoare triple {19603#false} assume 8528 == #t~mem62;havoc #t~mem62; {19603#false} is VALID [2022-04-14 18:38:31,677 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-14 18:38:31,678 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-14 18:38:31,678 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-14 18:38:31,678 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-14 18:38:31,678 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-14 18:38:31,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {19603#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {19603#false} is VALID [2022-04-14 18:38:31,678 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-14 18:38:31,678 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-14 18:38:31,678 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-14 18:38:31,678 INFO L290 TraceCheckUtils]: 58: Hoare triple {19603#false} ~skip~0 := 0; {19603#false} is VALID [2022-04-14 18:38:31,678 INFO L290 TraceCheckUtils]: 59: Hoare triple {19603#false} assume !false; {19603#false} is VALID [2022-04-14 18:38:31,678 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-14 18:38:31,678 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-14 18:38:31,678 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-14 18:38:31,678 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-14 18:38:31,678 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-14 18:38:31,678 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-14 18:38:31,678 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-14 18:38:31,678 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-14 18:38:31,678 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-14 18:38:31,678 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-14 18:38:31,679 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-14 18:38:31,679 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-14 18:38:31,679 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-14 18:38:31,679 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-14 18:38:31,679 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-14 18:38:31,679 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-14 18:38:31,679 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-14 18:38:31,679 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-14 18:38:31,679 INFO L290 TraceCheckUtils]: 78: Hoare triple {19603#false} assume 8544 == #t~mem64;havoc #t~mem64; {19603#false} is VALID [2022-04-14 18:38:31,679 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-14 18:38:31,679 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-14 18:38:31,679 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-14 18:38:31,679 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-14 18:38:31,679 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-14 18:38:31,679 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-14 18:38:31,679 INFO L290 TraceCheckUtils]: 85: Hoare triple {19603#false} assume 8 == ~blastFlag~0; {19603#false} is VALID [2022-04-14 18:38:31,679 INFO L290 TraceCheckUtils]: 86: Hoare triple {19603#false} assume !false; {19603#false} is VALID [2022-04-14 18:38:31,680 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-14 18:38:31,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:38:31,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238396737] [2022-04-14 18:38:31,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238396737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:38:31,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:38:31,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:38:31,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712151468] [2022-04-14 18:38:31,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:38:31,680 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-14 18:38:31,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:38:31,681 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-14 18:38:31,738 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-14 18:38:31,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:38:31,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:38:31,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:38:31,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:38:31,739 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-14 18:38:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:35,744 INFO L93 Difference]: Finished difference Result 537 states and 846 transitions. [2022-04-14 18:38:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:38:35,745 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-14 18:38:35,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:38:35,745 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-14 18:38:35,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-14 18:38:35,747 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-14 18:38:35,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-14 18:38:35,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-14 18:38:36,016 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-14 18:38:36,020 INFO L225 Difference]: With dead ends: 537 [2022-04-14 18:38:36,020 INFO L226 Difference]: Without dead ends: 302 [2022-04-14 18:38:36,020 INFO L912 BasicCegarLoop]: 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-14 18:38:36,021 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 30 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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, 2.1s IncrementalHoareTripleChecker+Time [2022-04-14 18:38:36,021 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 507 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-14 18:38:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-14 18:38:36,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 283. [2022-04-14 18:38:36,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:38:36,025 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-14 18:38:36,025 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-14 18:38:36,025 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-14 18:38:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:36,029 INFO L93 Difference]: Finished difference Result 302 states and 467 transitions. [2022-04-14 18:38:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 467 transitions. [2022-04-14 18:38:36,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:36,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:36,030 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-14 18:38:36,030 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-14 18:38:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:36,034 INFO L93 Difference]: Finished difference Result 302 states and 467 transitions. [2022-04-14 18:38:36,034 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 467 transitions. [2022-04-14 18:38:36,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:36,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:36,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:38:36,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:38:36,034 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-14 18:38:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 442 transitions. [2022-04-14 18:38:36,038 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 442 transitions. Word has length 87 [2022-04-14 18:38:36,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:38:36,038 INFO L478 AbstractCegarLoop]: Abstraction has 283 states and 442 transitions. [2022-04-14 18:38:36,038 INFO L479 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-14 18:38:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 442 transitions. [2022-04-14 18:38:36,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-14 18:38:36,039 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:38:36,039 INFO L499 BasicCegarLoop]: 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-14 18:38:36,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-14 18:38:36,039 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:38:36,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:38:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1766336105, now seen corresponding path program 1 times [2022-04-14 18:38:36,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:38:36,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017183830] [2022-04-14 18:38:36,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:38:36,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:38:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:36,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:38:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:36,145 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {21147#true} is VALID [2022-04-14 18:38:36,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {21147#true} assume true; {21147#true} is VALID [2022-04-14 18:38:36,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21147#true} {21147#true} #690#return; {21147#true} is VALID [2022-04-14 18:38:36,146 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-14 18:38:36,146 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {21147#true} is VALID [2022-04-14 18:38:36,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {21147#true} assume true; {21147#true} is VALID [2022-04-14 18:38:36,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21147#true} {21147#true} #690#return; {21147#true} is VALID [2022-04-14 18:38:36,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {21147#true} call #t~ret161 := main(); {21147#true} is VALID [2022-04-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {21147#true} assume !false; {21147#true} is VALID [2022-04-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,147 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-14 18:38:36,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {21147#true} assume 8464 == #t~mem55;havoc #t~mem55; {21147#true} is VALID [2022-04-14 18:38:36,148 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-14 18:38:36,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {21147#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21147#true} is VALID [2022-04-14 18:38:36,148 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-14 18:38:36,149 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-14 18:38:36,149 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-14 18:38:36,149 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-14 18:38:36,150 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-14 18:38:36,150 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-14 18:38:36,150 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-14 18:38:36,151 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-14 18:38:36,151 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-14 18:38:36,151 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-14 18:38:36,152 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-14 18:38:36,152 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-14 18:38:36,152 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-14 18:38:36,152 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-14 18:38:36,152 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-14 18:38:36,152 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-14 18:38:36,152 INFO L290 TraceCheckUtils]: 43: Hoare triple {21148#false} ~skip~0 := 0; {21148#false} is VALID [2022-04-14 18:38:36,152 INFO L290 TraceCheckUtils]: 44: Hoare triple {21148#false} assume !false; {21148#false} is VALID [2022-04-14 18:38:36,152 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-14 18:38:36,152 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-14 18:38:36,152 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-14 18:38:36,152 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-14 18:38:36,152 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-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 INFO L290 TraceCheckUtils]: 61: Hoare triple {21148#false} assume 8528 == #t~mem62;havoc #t~mem62; {21148#false} is VALID [2022-04-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 INFO L290 TraceCheckUtils]: 67: Hoare triple {21148#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {21148#false} is VALID [2022-04-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,153 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-14 18:38:36,154 INFO L290 TraceCheckUtils]: 71: Hoare triple {21148#false} ~skip~0 := 0; {21148#false} is VALID [2022-04-14 18:38:36,154 INFO L290 TraceCheckUtils]: 72: Hoare triple {21148#false} assume !false; {21148#false} is VALID [2022-04-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 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-14 18:38:36,154 INFO L290 TraceCheckUtils]: 91: Hoare triple {21148#false} assume 8544 == #t~mem64;havoc #t~mem64; {21148#false} is VALID [2022-04-14 18:38:36,155 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-14 18:38:36,155 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-14 18:38:36,155 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-14 18:38:36,155 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-14 18:38:36,155 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-14 18:38:36,155 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-14 18:38:36,155 INFO L290 TraceCheckUtils]: 98: Hoare triple {21148#false} assume 8 == ~blastFlag~0; {21148#false} is VALID [2022-04-14 18:38:36,155 INFO L290 TraceCheckUtils]: 99: Hoare triple {21148#false} assume !false; {21148#false} is VALID [2022-04-14 18:38:36,155 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-14 18:38:36,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:38:36,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017183830] [2022-04-14 18:38:36,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017183830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:38:36,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:38:36,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:38:36,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462963781] [2022-04-14 18:38:36,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:38:36,156 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-14 18:38:36,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:38:36,156 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-14 18:38:36,213 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-14 18:38:36,213 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:38:36,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:38:36,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:38:36,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:38:36,214 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-14 18:38:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:40,925 INFO L93 Difference]: Finished difference Result 657 states and 1030 transitions. [2022-04-14 18:38:40,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:38:40,925 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-14 18:38:40,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:38:40,925 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-14 18:38:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-14 18:38:40,928 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-14 18:38:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-14 18:38:40,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-14 18:38:41,290 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-14 18:38:41,296 INFO L225 Difference]: With dead ends: 657 [2022-04-14 18:38:41,296 INFO L226 Difference]: Without dead ends: 400 [2022-04-14 18:38:41,296 INFO L912 BasicCegarLoop]: 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-14 18:38:41,296 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 142 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-14 18:38:41,297 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 360 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-14 18:38:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-04-14 18:38:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 299. [2022-04-14 18:38:41,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:38:41,301 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-14 18:38:41,301 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-14 18:38:41,302 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-14 18:38:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:41,307 INFO L93 Difference]: Finished difference Result 400 states and 614 transitions. [2022-04-14 18:38:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2022-04-14 18:38:41,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:41,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:41,308 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-14 18:38:41,308 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-14 18:38:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:41,314 INFO L93 Difference]: Finished difference Result 400 states and 614 transitions. [2022-04-14 18:38:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2022-04-14 18:38:41,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:41,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:41,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:38:41,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:38:41,315 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-14 18:38:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 462 transitions. [2022-04-14 18:38:41,319 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 462 transitions. Word has length 100 [2022-04-14 18:38:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:38:41,319 INFO L478 AbstractCegarLoop]: Abstraction has 299 states and 462 transitions. [2022-04-14 18:38:41,319 INFO L479 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-14 18:38:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 462 transitions. [2022-04-14 18:38:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-14 18:38:41,320 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:38:41,320 INFO L499 BasicCegarLoop]: 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-14 18:38:41,320 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-14 18:38:41,320 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:38:41,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:38:41,320 INFO L85 PathProgramCache]: Analyzing trace with hash 500201960, now seen corresponding path program 1 times [2022-04-14 18:38:41,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:38:41,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167819134] [2022-04-14 18:38:41,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:38:41,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:38:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:41,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:38:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:41,424 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {23045#true} is VALID [2022-04-14 18:38:41,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {23045#true} assume true; {23045#true} is VALID [2022-04-14 18:38:41,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23045#true} {23045#true} #690#return; {23045#true} is VALID [2022-04-14 18:38:41,425 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-14 18:38:41,425 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {23045#true} is VALID [2022-04-14 18:38:41,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {23045#true} assume true; {23045#true} is VALID [2022-04-14 18:38:41,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23045#true} {23045#true} #690#return; {23045#true} is VALID [2022-04-14 18:38:41,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {23045#true} call #t~ret161 := main(); {23045#true} is VALID [2022-04-14 18:38:41,425 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-14 18:38:41,425 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-14 18:38:41,425 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-14 18:38:41,425 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-14 18:38:41,425 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-14 18:38:41,425 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-14 18:38:41,425 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-14 18:38:41,425 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-14 18:38:41,425 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-14 18:38:41,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {23045#true} assume !false; {23045#true} is VALID [2022-04-14 18:38:41,425 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-14 18:38:41,426 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-14 18:38:41,426 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-14 18:38:41,426 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-14 18:38:41,426 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-14 18:38:41,426 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-14 18:38:41,426 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-14 18:38:41,426 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-14 18:38:41,426 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-14 18:38:41,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {23045#true} assume 8464 == #t~mem55;havoc #t~mem55; {23045#true} is VALID [2022-04-14 18:38:41,426 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-14 18:38:41,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {23045#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23045#true} is VALID [2022-04-14 18:38:41,427 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-14 18:38:41,427 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-14 18:38:41,427 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-14 18:38:41,428 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-14 18:38:41,428 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-14 18:38:41,428 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-14 18:38:41,429 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-14 18:38:41,429 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-14 18:38:41,429 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-14 18:38:41,430 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-14 18:38:41,430 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-14 18:38:41,430 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-14 18:38:41,430 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-14 18:38:41,430 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {23046#false} ~skip~0 := 0; {23046#false} is VALID [2022-04-14 18:38:41,431 INFO L290 TraceCheckUtils]: 45: Hoare triple {23046#false} assume !false; {23046#false} is VALID [2022-04-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,431 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-14 18:38:41,432 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-14 18:38:41,432 INFO L290 TraceCheckUtils]: 62: Hoare triple {23046#false} assume 8528 == #t~mem62;havoc #t~mem62; {23046#false} is VALID [2022-04-14 18:38:41,432 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-14 18:38:41,432 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-14 18:38:41,432 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-14 18:38:41,432 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-14 18:38:41,432 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-14 18:38:41,432 INFO L290 TraceCheckUtils]: 68: Hoare triple {23046#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {23046#false} is VALID [2022-04-14 18:38:41,432 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-14 18:38:41,432 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-14 18:38:41,432 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-14 18:38:41,432 INFO L290 TraceCheckUtils]: 72: Hoare triple {23046#false} ~skip~0 := 0; {23046#false} is VALID [2022-04-14 18:38:41,432 INFO L290 TraceCheckUtils]: 73: Hoare triple {23046#false} assume !false; {23046#false} is VALID [2022-04-14 18:38:41,432 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-14 18:38:41,432 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-14 18:38:41,432 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-14 18:38:41,432 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-14 18:38:41,432 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-14 18:38:41,432 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-14 18:38:41,432 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-14 18:38:41,432 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-14 18:38:41,433 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-14 18:38:41,433 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-14 18:38:41,433 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-14 18:38:41,433 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-14 18:38:41,433 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-14 18:38:41,433 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-14 18:38:41,433 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-14 18:38:41,433 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-14 18:38:41,433 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-14 18:38:41,433 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-14 18:38:41,433 INFO L290 TraceCheckUtils]: 92: Hoare triple {23046#false} assume 8544 == #t~mem64;havoc #t~mem64; {23046#false} is VALID [2022-04-14 18:38:41,433 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-14 18:38:41,433 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-14 18:38:41,433 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-14 18:38:41,433 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-14 18:38:41,433 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-14 18:38:41,433 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-14 18:38:41,433 INFO L290 TraceCheckUtils]: 99: Hoare triple {23046#false} assume 8 == ~blastFlag~0; {23046#false} is VALID [2022-04-14 18:38:41,433 INFO L290 TraceCheckUtils]: 100: Hoare triple {23046#false} assume !false; {23046#false} is VALID [2022-04-14 18:38:41,435 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-14 18:38:41,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:38:41,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167819134] [2022-04-14 18:38:41,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167819134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:38:41,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:38:41,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:38:41,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571886497] [2022-04-14 18:38:41,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:38:41,437 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-14 18:38:41,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:38:41,437 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-14 18:38:41,488 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-14 18:38:41,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:38:41,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:38:41,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:38:41,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:38:41,489 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-14 18:38:44,531 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:38:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:49,581 INFO L93 Difference]: Finished difference Result 649 states and 1003 transitions. [2022-04-14 18:38:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:38:49,582 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-14 18:38:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:38:49,582 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-14 18:38:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-14 18:38:49,584 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-14 18:38:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-14 18:38:49,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-14 18:38:49,943 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-14 18:38:49,948 INFO L225 Difference]: With dead ends: 649 [2022-04-14 18:38:49,948 INFO L226 Difference]: Without dead ends: 376 [2022-04-14 18:38:49,949 INFO L912 BasicCegarLoop]: 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-14 18:38:49,949 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 141 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-14 18:38:49,949 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 360 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-14 18:38:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-04-14 18:38:49,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 299. [2022-04-14 18:38:49,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:38:49,953 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-14 18:38:49,954 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-14 18:38:49,954 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-14 18:38:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:49,959 INFO L93 Difference]: Finished difference Result 376 states and 567 transitions. [2022-04-14 18:38:49,959 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 567 transitions. [2022-04-14 18:38:49,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:49,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:49,960 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-14 18:38:49,960 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-14 18:38:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:38:49,965 INFO L93 Difference]: Finished difference Result 376 states and 567 transitions. [2022-04-14 18:38:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 567 transitions. [2022-04-14 18:38:49,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:38:49,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:38:49,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:38:49,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:38:49,966 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-14 18:38:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 458 transitions. [2022-04-14 18:38:49,970 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 458 transitions. Word has length 101 [2022-04-14 18:38:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:38:49,970 INFO L478 AbstractCegarLoop]: Abstraction has 299 states and 458 transitions. [2022-04-14 18:38:49,970 INFO L479 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-14 18:38:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 458 transitions. [2022-04-14 18:38:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-14 18:38:49,971 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:38:49,971 INFO L499 BasicCegarLoop]: 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-14 18:38:49,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-14 18:38:49,971 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:38:49,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:38:49,971 INFO L85 PathProgramCache]: Analyzing trace with hash 264152850, now seen corresponding path program 1 times [2022-04-14 18:38:49,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:38:49,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490315327] [2022-04-14 18:38:49,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:38:49,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:38:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:50,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:38:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:38:50,093 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {24889#true} is VALID [2022-04-14 18:38:50,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {24889#true} assume true; {24889#true} is VALID [2022-04-14 18:38:50,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24889#true} {24889#true} #690#return; {24889#true} is VALID [2022-04-14 18:38:50,093 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-14 18:38:50,094 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {24889#true} is VALID [2022-04-14 18:38:50,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {24889#true} assume true; {24889#true} is VALID [2022-04-14 18:38:50,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24889#true} {24889#true} #690#return; {24889#true} is VALID [2022-04-14 18:38:50,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {24889#true} call #t~ret161 := main(); {24889#true} is VALID [2022-04-14 18:38:50,094 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-14 18:38:50,094 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-14 18:38:50,094 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-14 18:38:50,094 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-14 18:38:50,094 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-14 18:38:50,094 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-14 18:38:50,094 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-14 18:38:50,094 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-14 18:38:50,094 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-14 18:38:50,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {24889#true} assume !false; {24889#true} is VALID [2022-04-14 18:38:50,094 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-14 18:38:50,094 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-14 18:38:50,094 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-14 18:38:50,094 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-14 18:38:50,094 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-14 18:38:50,094 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-14 18:38:50,095 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-14 18:38:50,095 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-14 18:38:50,095 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-14 18:38:50,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {24889#true} assume 8464 == #t~mem55;havoc #t~mem55; {24889#true} is VALID [2022-04-14 18:38:50,095 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-14 18:38:50,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {24889#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24889#true} is VALID [2022-04-14 18:38:50,095 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-14 18:38:50,095 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-14 18:38:50,095 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-14 18:38:50,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {24889#true} ~skip~0 := 0; {24889#true} is VALID [2022-04-14 18:38:50,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {24889#true} assume !false; {24889#true} is VALID [2022-04-14 18:38:50,095 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-14 18:38:50,095 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-14 18:38:50,095 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-14 18:38:50,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {24889#true} assume 8192 == #t~mem49;havoc #t~mem49; {24889#true} is VALID [2022-04-14 18:38:50,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {24889#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {24889#true} is VALID [2022-04-14 18:38:50,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {24889#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {24889#true} is VALID [2022-04-14 18:38:50,095 INFO L290 TraceCheckUtils]: 38: Hoare triple {24889#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {24889#true} is VALID [2022-04-14 18:38:50,095 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-14 18:38:50,095 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-14 18:38:50,096 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-14 18:38:50,096 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-14 18:38:50,097 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-14 18:38:50,097 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-14 18:38:50,098 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-14 18:38:50,098 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-14 18:38:50,098 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-14 18:38:50,099 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-14 18:38:50,099 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-14 18:38:50,099 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-14 18:38:50,100 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-14 18:38:50,100 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-14 18:38:50,100 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-14 18:38:50,100 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-14 18:38:50,100 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-14 18:38:50,100 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-14 18:38:50,100 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-14 18:38:50,100 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-14 18:38:50,101 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-14 18:38:50,101 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-14 18:38:50,101 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-14 18:38:50,101 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-14 18:38:50,101 INFO L290 TraceCheckUtils]: 63: Hoare triple {24890#false} assume 8528 == #t~mem62;havoc #t~mem62; {24890#false} is VALID [2022-04-14 18:38:50,101 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-14 18:38:50,101 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-14 18:38:50,101 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-14 18:38:50,101 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-14 18:38:50,101 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-14 18:38:50,101 INFO L290 TraceCheckUtils]: 69: Hoare triple {24890#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {24890#false} is VALID [2022-04-14 18:38:50,101 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-14 18:38:50,101 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-14 18:38:50,101 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-14 18:38:50,101 INFO L290 TraceCheckUtils]: 73: Hoare triple {24890#false} ~skip~0 := 0; {24890#false} is VALID [2022-04-14 18:38:50,101 INFO L290 TraceCheckUtils]: 74: Hoare triple {24890#false} assume !false; {24890#false} is VALID [2022-04-14 18:38:50,101 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-14 18:38:50,101 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-14 18:38:50,101 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-14 18:38:50,101 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-14 18:38:50,101 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 INFO L290 TraceCheckUtils]: 93: Hoare triple {24890#false} assume 8544 == #t~mem64;havoc #t~mem64; {24890#false} is VALID [2022-04-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,102 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-14 18:38:50,103 INFO L290 TraceCheckUtils]: 100: Hoare triple {24890#false} assume 8 == ~blastFlag~0; {24890#false} is VALID [2022-04-14 18:38:50,103 INFO L290 TraceCheckUtils]: 101: Hoare triple {24890#false} assume !false; {24890#false} is VALID [2022-04-14 18:38:50,103 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-14 18:38:50,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:38:50,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490315327] [2022-04-14 18:38:50,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490315327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:38:50,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:38:50,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:38:50,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943229340] [2022-04-14 18:38:50,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:38:50,104 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-14 18:38:50,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:38:50,104 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-14 18:38:50,174 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-14 18:38:50,174 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:38:50,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:38:50,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:38:50,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:38:50,175 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-14 18:38:52,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:38:55,305 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-14 18:38:56,977 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-14 18:39:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:00,326 INFO L93 Difference]: Finished difference Result 584 states and 901 transitions. [2022-04-14 18:39:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:39:00,326 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-14 18:39:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:39:00,327 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-14 18:39:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-04-14 18:39:00,329 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-14 18:39:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-04-14 18:39:00,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 450 transitions. [2022-04-14 18:39:00,592 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-14 18:39:00,595 INFO L225 Difference]: With dead ends: 584 [2022-04-14 18:39:00,596 INFO L226 Difference]: Without dead ends: 311 [2022-04-14 18:39:00,596 INFO L912 BasicCegarLoop]: 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-14 18:39:00,596 INFO L913 BasicCegarLoop]: 227 mSDtfsCounter, 19 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:39:00,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 568 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-14 18:39:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-14 18:39:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 299. [2022-04-14 18:39:00,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:39:00,617 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-14 18:39:00,617 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-14 18:39:00,617 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-14 18:39:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:00,624 INFO L93 Difference]: Finished difference Result 311 states and 472 transitions. [2022-04-14 18:39:00,624 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 472 transitions. [2022-04-14 18:39:00,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:00,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:00,625 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-14 18:39:00,625 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-14 18:39:00,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:00,629 INFO L93 Difference]: Finished difference Result 311 states and 472 transitions. [2022-04-14 18:39:00,629 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 472 transitions. [2022-04-14 18:39:00,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:00,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:00,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:39:00,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:39:00,630 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-14 18:39:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 457 transitions. [2022-04-14 18:39:00,634 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 457 transitions. Word has length 102 [2022-04-14 18:39:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:39:00,634 INFO L478 AbstractCegarLoop]: Abstraction has 299 states and 457 transitions. [2022-04-14 18:39:00,634 INFO L479 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-14 18:39:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 457 transitions. [2022-04-14 18:39:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-14 18:39:00,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:39:00,635 INFO L499 BasicCegarLoop]: 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-14 18:39:00,635 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-14 18:39:00,635 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:39:00,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:39:00,636 INFO L85 PathProgramCache]: Analyzing trace with hash -590509467, now seen corresponding path program 1 times [2022-04-14 18:39:00,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:39:00,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268306354] [2022-04-14 18:39:00,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:39:00,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:39:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:00,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:39:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:00,743 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {26521#true} is VALID [2022-04-14 18:39:00,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {26521#true} assume true; {26521#true} is VALID [2022-04-14 18:39:00,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26521#true} {26521#true} #690#return; {26521#true} is VALID [2022-04-14 18:39:00,744 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-14 18:39:00,744 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {26521#true} is VALID [2022-04-14 18:39:00,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {26521#true} assume true; {26521#true} is VALID [2022-04-14 18:39:00,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26521#true} {26521#true} #690#return; {26521#true} is VALID [2022-04-14 18:39:00,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {26521#true} call #t~ret161 := main(); {26521#true} is VALID [2022-04-14 18:39:00,745 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-14 18:39:00,745 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-14 18:39:00,745 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-14 18:39:00,745 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-14 18:39:00,745 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-14 18:39:00,745 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-14 18:39:00,745 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-14 18:39:00,745 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-14 18:39:00,745 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-14 18:39:00,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {26521#true} assume !false; {26521#true} is VALID [2022-04-14 18:39:00,745 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-14 18:39:00,745 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-14 18:39:00,745 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-14 18:39:00,745 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-14 18:39:00,745 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-14 18:39:00,745 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-14 18:39:00,745 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-14 18:39:00,746 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-14 18:39:00,746 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-14 18:39:00,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {26521#true} assume 8464 == #t~mem55;havoc #t~mem55; {26521#true} is VALID [2022-04-14 18:39:00,746 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-14 18:39:00,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {26521#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26521#true} is VALID [2022-04-14 18:39:00,747 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-14 18:39:00,747 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-14 18:39:00,747 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-14 18:39:00,748 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-14 18:39:00,748 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-14 18:39:00,748 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-14 18:39:00,749 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-14 18:39:00,749 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-14 18:39:00,749 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-14 18:39:00,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {26522#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {26522#false} is VALID [2022-04-14 18:39:00,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {26522#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26522#false} is VALID [2022-04-14 18:39:00,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {26522#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {26522#false} is VALID [2022-04-14 18:39:00,750 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-14 18:39:00,750 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-14 18:39:00,750 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-14 18:39:00,750 INFO L290 TraceCheckUtils]: 42: Hoare triple {26522#false} assume 12292 != #t~mem85;havoc #t~mem85; {26522#false} is VALID [2022-04-14 18:39:00,750 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-14 18:39:00,750 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-14 18:39:00,750 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-14 18:39:00,750 INFO L290 TraceCheckUtils]: 46: Hoare triple {26522#false} ~skip~0 := 0; {26522#false} is VALID [2022-04-14 18:39:00,750 INFO L290 TraceCheckUtils]: 47: Hoare triple {26522#false} assume !false; {26522#false} is VALID [2022-04-14 18:39:00,750 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-14 18:39:00,750 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-14 18:39:00,750 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-14 18:39:00,750 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-14 18:39:00,750 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-14 18:39:00,750 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-14 18:39:00,750 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-14 18:39:00,751 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-14 18:39:00,751 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-14 18:39:00,751 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-14 18:39:00,751 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-14 18:39:00,751 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-14 18:39:00,751 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-14 18:39:00,751 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-14 18:39:00,751 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-14 18:39:00,751 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-14 18:39:00,751 INFO L290 TraceCheckUtils]: 64: Hoare triple {26522#false} assume 8528 == #t~mem62;havoc #t~mem62; {26522#false} is VALID [2022-04-14 18:39:00,751 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-14 18:39:00,751 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-14 18:39:00,751 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-14 18:39:00,751 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-14 18:39:00,751 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-14 18:39:00,751 INFO L290 TraceCheckUtils]: 70: Hoare triple {26522#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {26522#false} is VALID [2022-04-14 18:39:00,751 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-14 18:39:00,751 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-14 18:39:00,751 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-14 18:39:00,752 INFO L290 TraceCheckUtils]: 74: Hoare triple {26522#false} ~skip~0 := 0; {26522#false} is VALID [2022-04-14 18:39:00,752 INFO L290 TraceCheckUtils]: 75: Hoare triple {26522#false} assume !false; {26522#false} is VALID [2022-04-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,752 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-14 18:39:00,753 INFO L290 TraceCheckUtils]: 94: Hoare triple {26522#false} assume 8544 == #t~mem64;havoc #t~mem64; {26522#false} is VALID [2022-04-14 18:39:00,753 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-14 18:39:00,753 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-14 18:39:00,753 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-14 18:39:00,753 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-14 18:39:00,753 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-14 18:39:00,753 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-14 18:39:00,753 INFO L290 TraceCheckUtils]: 101: Hoare triple {26522#false} assume 8 == ~blastFlag~0; {26522#false} is VALID [2022-04-14 18:39:00,753 INFO L290 TraceCheckUtils]: 102: Hoare triple {26522#false} assume !false; {26522#false} is VALID [2022-04-14 18:39:00,753 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-14 18:39:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:39:00,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268306354] [2022-04-14 18:39:00,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268306354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:39:00,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:39:00,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:39:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208265749] [2022-04-14 18:39:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:39:00,754 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-14 18:39:00,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:39:00,754 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-14 18:39:00,815 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-14 18:39:00,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:39:00,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:39:00,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:39:00,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:39:00,816 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-14 18:39:05,068 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-14 18:39:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:07,667 INFO L93 Difference]: Finished difference Result 589 states and 907 transitions. [2022-04-14 18:39:07,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:39:07,667 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-14 18:39:07,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:39:07,668 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-14 18:39:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-14 18:39:07,677 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-14 18:39:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-14 18:39:07,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-14 18:39:07,952 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-14 18:39:07,955 INFO L225 Difference]: With dead ends: 589 [2022-04-14 18:39:07,956 INFO L226 Difference]: Without dead ends: 316 [2022-04-14 18:39:07,956 INFO L912 BasicCegarLoop]: 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-14 18:39:07,956 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 36 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-14 18:39:07,956 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 511 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-14 18:39:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-14 18:39:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 299. [2022-04-14 18:39:07,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:39:07,961 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-14 18:39:07,961 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-14 18:39:07,961 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-14 18:39:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:07,965 INFO L93 Difference]: Finished difference Result 316 states and 479 transitions. [2022-04-14 18:39:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 479 transitions. [2022-04-14 18:39:07,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:07,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:07,966 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-14 18:39:07,966 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-14 18:39:07,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:07,970 INFO L93 Difference]: Finished difference Result 316 states and 479 transitions. [2022-04-14 18:39:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 479 transitions. [2022-04-14 18:39:07,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:07,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:07,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:39:07,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:39:07,971 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-14 18:39:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 456 transitions. [2022-04-14 18:39:07,974 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 456 transitions. Word has length 103 [2022-04-14 18:39:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:39:07,975 INFO L478 AbstractCegarLoop]: Abstraction has 299 states and 456 transitions. [2022-04-14 18:39:07,975 INFO L479 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-14 18:39:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 456 transitions. [2022-04-14 18:39:07,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-14 18:39:07,975 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:39:07,975 INFO L499 BasicCegarLoop]: 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-14 18:39:07,976 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-14 18:39:07,976 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:39:07,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:39:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash 708251584, now seen corresponding path program 1 times [2022-04-14 18:39:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:39:07,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107300081] [2022-04-14 18:39:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:39:07,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:39:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:08,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:39:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:08,074 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {28169#true} is VALID [2022-04-14 18:39:08,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {28169#true} assume true; {28169#true} is VALID [2022-04-14 18:39:08,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28169#true} {28169#true} #690#return; {28169#true} is VALID [2022-04-14 18:39:08,075 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-14 18:39:08,075 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {28169#true} is VALID [2022-04-14 18:39:08,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {28169#true} assume true; {28169#true} is VALID [2022-04-14 18:39:08,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28169#true} {28169#true} #690#return; {28169#true} is VALID [2022-04-14 18:39:08,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {28169#true} call #t~ret161 := main(); {28169#true} is VALID [2022-04-14 18:39:08,075 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-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {28169#true} assume !false; {28169#true} is VALID [2022-04-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,076 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-14 18:39:08,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {28169#true} assume 8464 == #t~mem55;havoc #t~mem55; {28169#true} is VALID [2022-04-14 18:39:08,077 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-14 18:39:08,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {28169#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28169#true} is VALID [2022-04-14 18:39:08,077 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-14 18:39:08,078 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-14 18:39:08,078 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-14 18:39:08,078 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-14 18:39:08,079 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-14 18:39:08,079 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-14 18:39:08,079 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-14 18:39:08,080 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-14 18:39:08,080 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-14 18:39:08,080 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-14 18:39:08,081 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-14 18:39:08,081 INFO L290 TraceCheckUtils]: 38: Hoare triple {28170#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {28170#false} is VALID [2022-04-14 18:39:08,081 INFO L290 TraceCheckUtils]: 39: Hoare triple {28170#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {28170#false} is VALID [2022-04-14 18:39:08,081 INFO L290 TraceCheckUtils]: 40: Hoare triple {28170#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {28170#false} is VALID [2022-04-14 18:39:08,081 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-14 18:39:08,081 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-14 18:39:08,081 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-14 18:39:08,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {28170#false} assume 12292 != #t~mem85;havoc #t~mem85; {28170#false} is VALID [2022-04-14 18:39:08,081 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-14 18:39:08,081 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-14 18:39:08,081 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-14 18:39:08,081 INFO L290 TraceCheckUtils]: 48: Hoare triple {28170#false} ~skip~0 := 0; {28170#false} is VALID [2022-04-14 18:39:08,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {28170#false} assume !false; {28170#false} is VALID [2022-04-14 18:39:08,081 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-14 18:39:08,081 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-14 18:39:08,081 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-14 18:39:08,081 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-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 INFO L290 TraceCheckUtils]: 66: Hoare triple {28170#false} assume 8528 == #t~mem62;havoc #t~mem62; {28170#false} is VALID [2022-04-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,082 INFO L290 TraceCheckUtils]: 72: Hoare triple {28170#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {28170#false} is VALID [2022-04-14 18:39:08,082 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-14 18:39:08,082 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-14 18:39:08,083 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-14 18:39:08,083 INFO L290 TraceCheckUtils]: 76: Hoare triple {28170#false} ~skip~0 := 0; {28170#false} is VALID [2022-04-14 18:39:08,083 INFO L290 TraceCheckUtils]: 77: Hoare triple {28170#false} assume !false; {28170#false} is VALID [2022-04-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,083 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-14 18:39:08,084 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-14 18:39:08,084 INFO L290 TraceCheckUtils]: 96: Hoare triple {28170#false} assume 8544 == #t~mem64;havoc #t~mem64; {28170#false} is VALID [2022-04-14 18:39:08,084 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-14 18:39:08,084 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-14 18:39:08,084 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-14 18:39:08,084 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-14 18:39:08,084 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-14 18:39:08,084 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-14 18:39:08,084 INFO L290 TraceCheckUtils]: 103: Hoare triple {28170#false} assume 8 == ~blastFlag~0; {28170#false} is VALID [2022-04-14 18:39:08,084 INFO L290 TraceCheckUtils]: 104: Hoare triple {28170#false} assume !false; {28170#false} is VALID [2022-04-14 18:39:08,084 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-14 18:39:08,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:39:08,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107300081] [2022-04-14 18:39:08,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107300081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:39:08,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:39:08,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:39:08,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705101636] [2022-04-14 18:39:08,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:39:08,085 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-14 18:39:08,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:39:08,085 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-14 18:39:08,145 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-14 18:39:08,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:39:08,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:39:08,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:39:08,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:39:08,146 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-14 18:39:11,595 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-14 18:39:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:14,132 INFO L93 Difference]: Finished difference Result 579 states and 892 transitions. [2022-04-14 18:39:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:39:14,132 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-14 18:39:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:39:14,133 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-14 18:39:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-14 18:39:14,134 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-14 18:39:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-14 18:39:14,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-14 18:39:14,400 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-14 18:39:14,403 INFO L225 Difference]: With dead ends: 579 [2022-04-14 18:39:14,403 INFO L226 Difference]: Without dead ends: 306 [2022-04-14 18:39:14,404 INFO L912 BasicCegarLoop]: 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-14 18:39:14,404 INFO L913 BasicCegarLoop]: 206 mSDtfsCounter, 26 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-14 18:39:14,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 525 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 374 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-04-14 18:39:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-04-14 18:39:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 299. [2022-04-14 18:39:14,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:39:14,408 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-14 18:39:14,409 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-14 18:39:14,409 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-14 18:39:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:14,412 INFO L93 Difference]: Finished difference Result 306 states and 465 transitions. [2022-04-14 18:39:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 465 transitions. [2022-04-14 18:39:14,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:14,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:14,413 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-14 18:39:14,413 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-14 18:39:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:14,417 INFO L93 Difference]: Finished difference Result 306 states and 465 transitions. [2022-04-14 18:39:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 465 transitions. [2022-04-14 18:39:14,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:14,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:14,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:39:14,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:39:14,418 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-14 18:39:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 455 transitions. [2022-04-14 18:39:14,422 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 455 transitions. Word has length 105 [2022-04-14 18:39:14,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:39:14,422 INFO L478 AbstractCegarLoop]: Abstraction has 299 states and 455 transitions. [2022-04-14 18:39:14,422 INFO L479 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-14 18:39:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 455 transitions. [2022-04-14 18:39:14,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-14 18:39:14,423 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:39:14,423 INFO L499 BasicCegarLoop]: 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-14 18:39:14,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-14 18:39:14,423 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:39:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:39:14,423 INFO L85 PathProgramCache]: Analyzing trace with hash -953511784, now seen corresponding path program 1 times [2022-04-14 18:39:14,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:39:14,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232704045] [2022-04-14 18:39:14,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:39:14,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:39:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:14,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:39:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:14,522 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {29786#true} is VALID [2022-04-14 18:39:14,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {29786#true} assume true; {29786#true} is VALID [2022-04-14 18:39:14,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29786#true} {29786#true} #690#return; {29786#true} is VALID [2022-04-14 18:39:14,523 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-14 18:39:14,523 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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {29786#true} is VALID [2022-04-14 18:39:14,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {29786#true} assume true; {29786#true} is VALID [2022-04-14 18:39:14,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29786#true} {29786#true} #690#return; {29786#true} is VALID [2022-04-14 18:39:14,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {29786#true} call #t~ret161 := main(); {29786#true} is VALID [2022-04-14 18:39:14,523 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-14 18:39:14,523 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-14 18:39:14,523 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-14 18:39:14,524 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-14 18:39:14,524 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-14 18:39:14,524 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-14 18:39:14,524 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-14 18:39:14,524 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-14 18:39:14,524 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-14 18:39:14,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {29786#true} assume !false; {29786#true} is VALID [2022-04-14 18:39:14,524 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-14 18:39:14,524 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-14 18:39:14,524 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-14 18:39:14,524 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-14 18:39:14,524 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-14 18:39:14,524 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-14 18:39:14,524 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-14 18:39:14,524 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-14 18:39:14,524 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-14 18:39:14,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {29786#true} assume 8464 == #t~mem55;havoc #t~mem55; {29786#true} is VALID [2022-04-14 18:39:14,524 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-14 18:39:14,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {29786#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29786#true} is VALID [2022-04-14 18:39:14,524 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-14 18:39:14,525 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-14 18:39:14,525 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-14 18:39:14,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {29786#true} ~skip~0 := 0; {29786#true} is VALID [2022-04-14 18:39:14,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {29786#true} assume !false; {29786#true} is VALID [2022-04-14 18:39:14,525 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-14 18:39:14,525 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-14 18:39:14,525 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-14 18:39:14,525 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-14 18:39:14,525 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-14 18:39:14,525 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-14 18:39:14,525 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-14 18:39:14,525 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-14 18:39:14,525 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-14 18:39:14,525 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-14 18:39:14,525 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-14 18:39:14,525 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-14 18:39:14,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {29786#true} assume 8496 == #t~mem58;havoc #t~mem58; {29786#true} is VALID [2022-04-14 18:39:14,525 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-14 18:39:14,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {29786#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {29786#true} is VALID [2022-04-14 18:39:14,526 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-14 18:39:14,526 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-14 18:39:14,527 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-14 18:39:14,527 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-14 18:39:14,528 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-14 18:39:14,528 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-14 18:39:14,528 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-14 18:39:14,528 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-14 18:39:14,529 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-14 18:39:14,529 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-14 18:39:14,529 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-14 18:39:14,530 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-14 18:39:14,530 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-14 18:39:14,530 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-14 18:39:14,531 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-14 18:39:14,531 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-14 18:39:14,531 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-14 18:39:14,532 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-14 18:39:14,532 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-14 18:39:14,532 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-14 18:39:14,533 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-14 18:39:14,533 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-14 18:39:14,533 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-14 18:39:14,533 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-14 18:39:14,534 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-14 18:39:14,534 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-14 18:39:14,534 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-14 18:39:14,534 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-14 18:39:14,534 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-14 18:39:14,534 INFO L290 TraceCheckUtils]: 76: Hoare triple {29787#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {29787#false} is VALID [2022-04-14 18:39:14,534 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-14 18:39:14,534 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-14 18:39:14,534 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-14 18:39:14,534 INFO L290 TraceCheckUtils]: 80: Hoare triple {29787#false} ~skip~0 := 0; {29787#false} is VALID [2022-04-14 18:39:14,534 INFO L290 TraceCheckUtils]: 81: Hoare triple {29787#false} assume !false; {29787#false} is VALID [2022-04-14 18:39:14,534 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-14 18:39:14,534 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-14 18:39:14,534 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-14 18:39:14,534 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-14 18:39:14,534 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-14 18:39:14,534 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-14 18:39:14,534 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-14 18:39:14,534 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-14 18:39:14,534 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-14 18:39:14,535 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-14 18:39:14,535 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-14 18:39:14,535 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-14 18:39:14,535 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-14 18:39:14,535 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-14 18:39:14,535 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-14 18:39:14,535 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-14 18:39:14,535 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-14 18:39:14,535 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-14 18:39:14,535 INFO L290 TraceCheckUtils]: 100: Hoare triple {29787#false} assume 8544 == #t~mem64;havoc #t~mem64; {29787#false} is VALID [2022-04-14 18:39:14,535 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-14 18:39:14,535 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-14 18:39:14,535 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-14 18:39:14,535 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-14 18:39:14,535 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-14 18:39:14,535 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-14 18:39:14,535 INFO L290 TraceCheckUtils]: 107: Hoare triple {29787#false} assume 8 == ~blastFlag~0; {29787#false} is VALID [2022-04-14 18:39:14,535 INFO L290 TraceCheckUtils]: 108: Hoare triple {29787#false} assume !false; {29787#false} is VALID [2022-04-14 18:39:14,536 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-14 18:39:14,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:39:14,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232704045] [2022-04-14 18:39:14,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232704045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:39:14,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:39:14,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:39:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453383608] [2022-04-14 18:39:14,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:39:14,537 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-14 18:39:14,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:39:14,537 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-14 18:39:14,601 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-14 18:39:14,601 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:39:14,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:39:14,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:39:14,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:39:14,602 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-14 18:39:20,275 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-14 18:39:21,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:21,333 INFO L93 Difference]: Finished difference Result 661 states and 1011 transitions. [2022-04-14 18:39:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:39:21,333 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-14 18:39:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:39:21,333 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-14 18:39:21,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2022-04-14 18:39:21,335 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-14 18:39:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2022-04-14 18:39:21,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 542 transitions. [2022-04-14 18:39:21,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 542 edges. 542 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:39:21,666 INFO L225 Difference]: With dead ends: 661 [2022-04-14 18:39:21,666 INFO L226 Difference]: Without dead ends: 388 [2022-04-14 18:39:21,667 INFO L912 BasicCegarLoop]: 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-14 18:39:21,667 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 84 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-14 18:39:21,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 493 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-14 18:39:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-04-14 18:39:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 327. [2022-04-14 18:39:21,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:39:21,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 388 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-14 18:39:21,672 INFO L74 IsIncluded]: Start isIncluded. First operand 388 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-14 18:39:21,672 INFO L87 Difference]: Start difference. First operand 388 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-14 18:39:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:21,678 INFO L93 Difference]: Finished difference Result 388 states and 585 transitions. [2022-04-14 18:39:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 585 transitions. [2022-04-14 18:39:21,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:21,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:21,679 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 388 states. [2022-04-14 18:39:21,679 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 388 states. [2022-04-14 18:39:21,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:21,685 INFO L93 Difference]: Finished difference Result 388 states and 585 transitions. [2022-04-14 18:39:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 585 transitions. [2022-04-14 18:39:21,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:21,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:21,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:39:21,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:39:21,686 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-14 18:39:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 497 transitions. [2022-04-14 18:39:21,690 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 497 transitions. Word has length 109 [2022-04-14 18:39:21,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:39:21,690 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 497 transitions. [2022-04-14 18:39:21,690 INFO L479 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-14 18:39:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 497 transitions. [2022-04-14 18:39:21,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-14 18:39:21,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:39:21,691 INFO L499 BasicCegarLoop]: 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-14 18:39:21,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-14 18:39:21,691 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:39:21,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:39:21,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1008062874, now seen corresponding path program 1 times [2022-04-14 18:39:21,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:39:21,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458241712] [2022-04-14 18:39:21,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:39:21,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:39:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:39:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:21,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {31698#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {31691#true} is VALID [2022-04-14 18:39:21,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {31691#true} assume true; {31691#true} is VALID [2022-04-14 18:39:21,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31691#true} {31691#true} #690#return; {31691#true} is VALID [2022-04-14 18:39:21,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {31691#true} call ULTIMATE.init(); {31698#(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-14 18:39:21,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {31698#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {31691#true} is VALID [2022-04-14 18:39:21,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {31691#true} assume true; {31691#true} is VALID [2022-04-14 18:39:21,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31691#true} {31691#true} #690#return; {31691#true} is VALID [2022-04-14 18:39:21,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {31691#true} call #t~ret161 := main(); {31691#true} is VALID [2022-04-14 18:39:21,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {31691#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; {31691#true} is VALID [2022-04-14 18:39:21,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {31691#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,808 INFO L272 TraceCheckUtils]: 7: Hoare triple {31691#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {31691#true} is VALID [2022-04-14 18:39:21,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {31691#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); {31691#true} is VALID [2022-04-14 18:39:21,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {31691#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; {31691#true} is VALID [2022-04-14 18:39:21,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {31691#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; {31691#true} is VALID [2022-04-14 18:39:21,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {31691#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {31691#true} is VALID [2022-04-14 18:39:21,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {31691#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {31691#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {31691#true} assume !false; {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {31691#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); {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {31691#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {31691#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {31691#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {31691#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {31691#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {31691#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {31691#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {31691#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {31691#true} assume 8464 == #t~mem55;havoc #t~mem55; {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {31691#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; {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {31691#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {31691#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); {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {31691#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); {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {31691#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {31691#true} ~skip~0 := 0; {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {31691#true} assume !false; {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {31691#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); {31691#true} is VALID [2022-04-14 18:39:21,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {31691#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {31691#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {31691#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {31691#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {31691#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {31691#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,810 INFO L290 TraceCheckUtils]: 39: Hoare triple {31691#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {31691#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,810 INFO L290 TraceCheckUtils]: 41: Hoare triple {31691#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {31691#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {31691#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {31691#true} assume 8496 == #t~mem58;havoc #t~mem58; {31691#true} is VALID [2022-04-14 18:39:21,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {31691#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {31691#true} is VALID [2022-04-14 18:39:21,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {31691#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {31691#true} is VALID [2022-04-14 18:39:21,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {31691#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {31691#true} is VALID [2022-04-14 18:39:21,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {31691#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,812 INFO L290 TraceCheckUtils]: 51: Hoare triple {31696#(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; {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,812 INFO L290 TraceCheckUtils]: 52: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,813 INFO L290 TraceCheckUtils]: 53: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,813 INFO L290 TraceCheckUtils]: 54: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,813 INFO L290 TraceCheckUtils]: 55: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,813 INFO L290 TraceCheckUtils]: 56: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,814 INFO L290 TraceCheckUtils]: 59: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,815 INFO L290 TraceCheckUtils]: 60: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,815 INFO L290 TraceCheckUtils]: 61: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,815 INFO L290 TraceCheckUtils]: 62: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,816 INFO L290 TraceCheckUtils]: 63: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,816 INFO L290 TraceCheckUtils]: 64: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,816 INFO L290 TraceCheckUtils]: 65: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,816 INFO L290 TraceCheckUtils]: 66: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,817 INFO L290 TraceCheckUtils]: 67: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,817 INFO L290 TraceCheckUtils]: 68: Hoare triple {31696#(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); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:21,817 INFO L290 TraceCheckUtils]: 69: Hoare triple {31696#(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); {31697#(not (= |ssl3_accept_#t~mem62| 8528))} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 70: Hoare triple {31697#(not (= |ssl3_accept_#t~mem62| 8528))} assume 8528 == #t~mem62;havoc #t~mem62; {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 71: Hoare triple {31692#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); {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 72: Hoare triple {31692#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; {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 73: Hoare triple {31692#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); {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 74: Hoare triple {31692#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 75: Hoare triple {31692#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 76: Hoare triple {31692#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 77: Hoare triple {31692#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 78: Hoare triple {31692#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); {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 79: Hoare triple {31692#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 80: Hoare triple {31692#false} ~skip~0 := 0; {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 81: Hoare triple {31692#false} assume !false; {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 82: Hoare triple {31692#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); {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 83: Hoare triple {31692#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 84: Hoare triple {31692#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 85: Hoare triple {31692#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 86: Hoare triple {31692#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 87: Hoare triple {31692#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 88: Hoare triple {31692#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,818 INFO L290 TraceCheckUtils]: 89: Hoare triple {31692#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 90: Hoare triple {31692#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 91: Hoare triple {31692#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 92: Hoare triple {31692#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 93: Hoare triple {31692#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 94: Hoare triple {31692#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 95: Hoare triple {31692#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 96: Hoare triple {31692#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 97: Hoare triple {31692#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 98: Hoare triple {31692#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 99: Hoare triple {31692#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 100: Hoare triple {31692#false} assume 8544 == #t~mem64;havoc #t~mem64; {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 101: Hoare triple {31692#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 102: Hoare triple {31692#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); {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 103: Hoare triple {31692#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 104: Hoare triple {31692#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); {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 105: Hoare triple {31692#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; {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 106: Hoare triple {31692#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; {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 107: Hoare triple {31692#false} assume 8 == ~blastFlag~0; {31692#false} is VALID [2022-04-14 18:39:21,819 INFO L290 TraceCheckUtils]: 108: Hoare triple {31692#false} assume !false; {31692#false} is VALID [2022-04-14 18:39:21,820 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-14 18:39:21,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:39:21,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458241712] [2022-04-14 18:39:21,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458241712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:39:21,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:39:21,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:39:21,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659702314] [2022-04-14 18:39:21,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:39:21,821 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-14 18:39:21,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:39:21,821 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-14 18:39:21,881 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-14 18:39:21,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:39:21,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:39:21,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:39:21,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:39:21,882 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-14 18:39:25,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:39:26,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:39:28,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:39:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:31,048 INFO L93 Difference]: Finished difference Result 745 states and 1138 transitions. [2022-04-14 18:39:31,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:39:31,048 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-14 18:39:31,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:39:31,048 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-14 18:39:31,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-14 18:39:31,050 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-14 18:39:31,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-14 18:39:31,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-14 18:39:31,410 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-14 18:39:31,417 INFO L225 Difference]: With dead ends: 745 [2022-04-14 18:39:31,417 INFO L226 Difference]: Without dead ends: 444 [2022-04-14 18:39:31,417 INFO L912 BasicCegarLoop]: 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-14 18:39:31,418 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 131 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-14 18:39:31,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 360 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-14 18:39:31,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-04-14 18:39:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 325. [2022-04-14 18:39:31,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:39:31,424 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-14 18:39:31,424 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-14 18:39:31,425 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-14 18:39:31,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:31,439 INFO L93 Difference]: Finished difference Result 444 states and 668 transitions. [2022-04-14 18:39:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 668 transitions. [2022-04-14 18:39:31,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:31,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:31,440 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-14 18:39:31,440 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-14 18:39:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:31,447 INFO L93 Difference]: Finished difference Result 444 states and 668 transitions. [2022-04-14 18:39:31,447 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 668 transitions. [2022-04-14 18:39:31,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:31,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:31,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:39:31,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:39:31,448 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-14 18:39:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 493 transitions. [2022-04-14 18:39:31,452 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 493 transitions. Word has length 109 [2022-04-14 18:39:31,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:39:31,452 INFO L478 AbstractCegarLoop]: Abstraction has 325 states and 493 transitions. [2022-04-14 18:39:31,452 INFO L479 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-14 18:39:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 493 transitions. [2022-04-14 18:39:31,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-14 18:39:31,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:39:31,453 INFO L499 BasicCegarLoop]: 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-14 18:39:31,453 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-14 18:39:31,453 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:39:31,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:39:31,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1785226605, now seen corresponding path program 1 times [2022-04-14 18:39:31,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:39:31,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199986336] [2022-04-14 18:39:31,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:39:31,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:39:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:31,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:39:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:31,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {33808#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {33801#true} is VALID [2022-04-14 18:39:31,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {33801#true} assume true; {33801#true} is VALID [2022-04-14 18:39:31,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33801#true} {33801#true} #690#return; {33801#true} is VALID [2022-04-14 18:39:31,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {33801#true} call ULTIMATE.init(); {33808#(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-14 18:39:31,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {33808#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {33801#true} assume true; {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33801#true} {33801#true} #690#return; {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {33801#true} call #t~ret161 := main(); {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {33801#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; {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {33801#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L272 TraceCheckUtils]: 7: Hoare triple {33801#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {33801#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); {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {33801#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; {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {33801#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; {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {33801#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {33801#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {33801#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {33801#true} assume !false; {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {33801#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); {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {33801#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {33801#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {33801#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {33801#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {33801#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {33801#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {33801#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {33801#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {33801#true} assume 8464 == #t~mem55;havoc #t~mem55; {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {33801#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; {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {33801#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {33801#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); {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {33801#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); {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {33801#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {33801#true} ~skip~0 := 0; {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {33801#true} assume !false; {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {33801#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); {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {33801#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {33801#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 35: Hoare triple {33801#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {33801#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {33801#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {33801#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {33801#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {33801#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {33801#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {33801#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,558 INFO L290 TraceCheckUtils]: 43: Hoare triple {33801#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {33801#true} assume 8496 == #t~mem58;havoc #t~mem58; {33801#true} is VALID [2022-04-14 18:39:31,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {33801#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {33801#true} is VALID [2022-04-14 18:39:31,558 INFO L290 TraceCheckUtils]: 46: Hoare triple {33801#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {33801#true} is VALID [2022-04-14 18:39:31,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {33801#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {33801#true} is VALID [2022-04-14 18:39:31,558 INFO L290 TraceCheckUtils]: 48: Hoare triple {33801#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {33806#(= 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; {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,561 INFO L290 TraceCheckUtils]: 54: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,561 INFO L290 TraceCheckUtils]: 55: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,561 INFO L290 TraceCheckUtils]: 56: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,562 INFO L290 TraceCheckUtils]: 58: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,562 INFO L290 TraceCheckUtils]: 59: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,563 INFO L290 TraceCheckUtils]: 60: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,563 INFO L290 TraceCheckUtils]: 61: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,563 INFO L290 TraceCheckUtils]: 62: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,563 INFO L290 TraceCheckUtils]: 63: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,564 INFO L290 TraceCheckUtils]: 64: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,564 INFO L290 TraceCheckUtils]: 65: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,564 INFO L290 TraceCheckUtils]: 66: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,565 INFO L290 TraceCheckUtils]: 67: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,565 INFO L290 TraceCheckUtils]: 68: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,565 INFO L290 TraceCheckUtils]: 69: Hoare triple {33806#(= 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); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:31,566 INFO L290 TraceCheckUtils]: 70: Hoare triple {33806#(= 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); {33807#(= |ssl3_accept_#t~mem63| 8656)} is VALID [2022-04-14 18:39:31,566 INFO L290 TraceCheckUtils]: 71: Hoare triple {33807#(= |ssl3_accept_#t~mem63| 8656)} assume 8529 == #t~mem63;havoc #t~mem63; {33802#false} is VALID [2022-04-14 18:39:31,566 INFO L290 TraceCheckUtils]: 72: Hoare triple {33802#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); {33802#false} is VALID [2022-04-14 18:39:31,566 INFO L290 TraceCheckUtils]: 73: Hoare triple {33802#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; {33802#false} is VALID [2022-04-14 18:39:31,566 INFO L290 TraceCheckUtils]: 74: Hoare triple {33802#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); {33802#false} is VALID [2022-04-14 18:39:31,566 INFO L290 TraceCheckUtils]: 75: Hoare triple {33802#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {33802#false} is VALID [2022-04-14 18:39:31,566 INFO L290 TraceCheckUtils]: 76: Hoare triple {33802#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {33802#false} is VALID [2022-04-14 18:39:31,566 INFO L290 TraceCheckUtils]: 77: Hoare triple {33802#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {33802#false} is VALID [2022-04-14 18:39:31,566 INFO L290 TraceCheckUtils]: 78: Hoare triple {33802#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,566 INFO L290 TraceCheckUtils]: 79: Hoare triple {33802#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); {33802#false} is VALID [2022-04-14 18:39:31,566 INFO L290 TraceCheckUtils]: 80: Hoare triple {33802#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 81: Hoare triple {33802#false} ~skip~0 := 0; {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 82: Hoare triple {33802#false} assume !false; {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 83: Hoare triple {33802#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); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 84: Hoare triple {33802#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 85: Hoare triple {33802#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 86: Hoare triple {33802#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 87: Hoare triple {33802#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 88: Hoare triple {33802#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 89: Hoare triple {33802#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 90: Hoare triple {33802#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 91: Hoare triple {33802#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 92: Hoare triple {33802#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 93: Hoare triple {33802#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 94: Hoare triple {33802#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 95: Hoare triple {33802#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 96: Hoare triple {33802#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 97: Hoare triple {33802#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 98: Hoare triple {33802#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,567 INFO L290 TraceCheckUtils]: 99: Hoare triple {33802#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,568 INFO L290 TraceCheckUtils]: 100: Hoare triple {33802#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,568 INFO L290 TraceCheckUtils]: 101: Hoare triple {33802#false} assume 8544 == #t~mem64;havoc #t~mem64; {33802#false} is VALID [2022-04-14 18:39:31,568 INFO L290 TraceCheckUtils]: 102: Hoare triple {33802#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {33802#false} is VALID [2022-04-14 18:39:31,568 INFO L290 TraceCheckUtils]: 103: Hoare triple {33802#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); {33802#false} is VALID [2022-04-14 18:39:31,568 INFO L290 TraceCheckUtils]: 104: Hoare triple {33802#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {33802#false} is VALID [2022-04-14 18:39:31,568 INFO L290 TraceCheckUtils]: 105: Hoare triple {33802#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); {33802#false} is VALID [2022-04-14 18:39:31,568 INFO L290 TraceCheckUtils]: 106: Hoare triple {33802#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; {33802#false} is VALID [2022-04-14 18:39:31,568 INFO L290 TraceCheckUtils]: 107: Hoare triple {33802#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; {33802#false} is VALID [2022-04-14 18:39:31,568 INFO L290 TraceCheckUtils]: 108: Hoare triple {33802#false} assume 8 == ~blastFlag~0; {33802#false} is VALID [2022-04-14 18:39:31,568 INFO L290 TraceCheckUtils]: 109: Hoare triple {33802#false} assume !false; {33802#false} is VALID [2022-04-14 18:39:31,568 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-14 18:39:31,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:39:31,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199986336] [2022-04-14 18:39:31,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199986336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:39:31,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:39:31,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:39:31,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237763254] [2022-04-14 18:39:31,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:39:31,569 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-14 18:39:31,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:39:31,569 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-14 18:39:31,640 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-14 18:39:31,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:39:31,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:39:31,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:39:31,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:39:31,641 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-14 18:39:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:37,171 INFO L93 Difference]: Finished difference Result 711 states and 1083 transitions. [2022-04-14 18:39:37,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:39:37,172 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-14 18:39:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:39:37,172 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-14 18:39:37,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2022-04-14 18:39:37,176 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-14 18:39:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2022-04-14 18:39:37,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 538 transitions. [2022-04-14 18:39:37,495 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-14 18:39:37,501 INFO L225 Difference]: With dead ends: 711 [2022-04-14 18:39:37,502 INFO L226 Difference]: Without dead ends: 412 [2022-04-14 18:39:37,502 INFO L912 BasicCegarLoop]: 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-14 18:39:37,502 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 81 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 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-14 18:39:37,503 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 493 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-14 18:39:37,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-04-14 18:39:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 354. [2022-04-14 18:39:37,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:39:37,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 412 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-14 18:39:37,508 INFO L74 IsIncluded]: Start isIncluded. First operand 412 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-14 18:39:37,508 INFO L87 Difference]: Start difference. First operand 412 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-14 18:39:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:37,514 INFO L93 Difference]: Finished difference Result 412 states and 619 transitions. [2022-04-14 18:39:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 619 transitions. [2022-04-14 18:39:37,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:37,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:37,514 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 412 states. [2022-04-14 18:39:37,515 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 412 states. [2022-04-14 18:39:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:37,520 INFO L93 Difference]: Finished difference Result 412 states and 619 transitions. [2022-04-14 18:39:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 619 transitions. [2022-04-14 18:39:37,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:37,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:37,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:39:37,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:39:37,521 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-14 18:39:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 536 transitions. [2022-04-14 18:39:37,526 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 536 transitions. Word has length 110 [2022-04-14 18:39:37,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:39:37,526 INFO L478 AbstractCegarLoop]: Abstraction has 354 states and 536 transitions. [2022-04-14 18:39:37,526 INFO L479 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-14 18:39:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 536 transitions. [2022-04-14 18:39:37,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-14 18:39:37,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:39:37,527 INFO L499 BasicCegarLoop]: 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-14 18:39:37,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-14 18:39:37,527 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:39:37,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:39:37,527 INFO L85 PathProgramCache]: Analyzing trace with hash -863733163, now seen corresponding path program 1 times [2022-04-14 18:39:37,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:39:37,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477630943] [2022-04-14 18:39:37,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:39:37,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:39:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:37,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:39:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:37,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {35843#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {35836#true} is VALID [2022-04-14 18:39:37,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {35836#true} assume true; {35836#true} is VALID [2022-04-14 18:39:37,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35836#true} {35836#true} #690#return; {35836#true} is VALID [2022-04-14 18:39:37,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {35836#true} call ULTIMATE.init(); {35843#(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-14 18:39:37,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {35843#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {35836#true} is VALID [2022-04-14 18:39:37,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {35836#true} assume true; {35836#true} is VALID [2022-04-14 18:39:37,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35836#true} {35836#true} #690#return; {35836#true} is VALID [2022-04-14 18:39:37,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {35836#true} call #t~ret161 := main(); {35836#true} is VALID [2022-04-14 18:39:37,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {35836#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; {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {35836#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L272 TraceCheckUtils]: 7: Hoare triple {35836#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {35836#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); {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {35836#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; {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {35836#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; {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {35836#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {35836#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {35836#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {35836#true} assume !false; {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {35836#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); {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {35836#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {35836#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {35836#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {35836#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {35836#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {35836#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {35836#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {35836#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {35836#true} assume 8464 == #t~mem55;havoc #t~mem55; {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {35836#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; {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {35836#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {35836#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); {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {35836#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); {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {35836#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {35836#true} ~skip~0 := 0; {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {35836#true} assume !false; {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {35836#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); {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {35836#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {35836#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {35836#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {35836#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {35836#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 38: Hoare triple {35836#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 39: Hoare triple {35836#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 40: Hoare triple {35836#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {35836#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {35836#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {35836#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {35836#true} assume 8496 == #t~mem58;havoc #t~mem58; {35836#true} is VALID [2022-04-14 18:39:37,641 INFO L290 TraceCheckUtils]: 45: Hoare triple {35836#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {35836#true} is VALID [2022-04-14 18:39:37,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {35836#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {35836#true} is VALID [2022-04-14 18:39:37,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {35836#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {35836#true} is VALID [2022-04-14 18:39:37,641 INFO L290 TraceCheckUtils]: 48: Hoare triple {35836#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,642 INFO L290 TraceCheckUtils]: 49: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,642 INFO L290 TraceCheckUtils]: 50: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,642 INFO L290 TraceCheckUtils]: 51: Hoare triple {35841#(= 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; {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,643 INFO L290 TraceCheckUtils]: 52: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,643 INFO L290 TraceCheckUtils]: 54: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,644 INFO L290 TraceCheckUtils]: 55: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,644 INFO L290 TraceCheckUtils]: 56: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,644 INFO L290 TraceCheckUtils]: 57: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,644 INFO L290 TraceCheckUtils]: 58: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,645 INFO L290 TraceCheckUtils]: 59: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,645 INFO L290 TraceCheckUtils]: 60: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,645 INFO L290 TraceCheckUtils]: 61: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,646 INFO L290 TraceCheckUtils]: 62: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,646 INFO L290 TraceCheckUtils]: 63: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,646 INFO L290 TraceCheckUtils]: 64: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,646 INFO L290 TraceCheckUtils]: 65: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,647 INFO L290 TraceCheckUtils]: 67: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,647 INFO L290 TraceCheckUtils]: 68: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,648 INFO L290 TraceCheckUtils]: 69: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,648 INFO L290 TraceCheckUtils]: 70: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,648 INFO L290 TraceCheckUtils]: 71: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,648 INFO L290 TraceCheckUtils]: 72: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,649 INFO L290 TraceCheckUtils]: 73: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,649 INFO L290 TraceCheckUtils]: 74: Hoare triple {35841#(= 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); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:39:37,649 INFO L290 TraceCheckUtils]: 75: Hoare triple {35841#(= 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); {35842#(= |ssl3_accept_#t~mem68| 8656)} is VALID [2022-04-14 18:39:37,650 INFO L290 TraceCheckUtils]: 76: Hoare triple {35842#(= |ssl3_accept_#t~mem68| 8656)} assume 8448 == #t~mem68;havoc #t~mem68; {35837#false} is VALID [2022-04-14 18:39:37,650 INFO L290 TraceCheckUtils]: 77: Hoare triple {35837#false} assume !(~num1~0 > 0); {35837#false} is VALID [2022-04-14 18:39:37,650 INFO L290 TraceCheckUtils]: 78: Hoare triple {35837#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; {35837#false} is VALID [2022-04-14 18:39:37,650 INFO L290 TraceCheckUtils]: 79: Hoare triple {35837#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); {35837#false} is VALID [2022-04-14 18:39:37,650 INFO L290 TraceCheckUtils]: 80: Hoare triple {35837#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35837#false} is VALID [2022-04-14 18:39:37,650 INFO L290 TraceCheckUtils]: 81: Hoare triple {35837#false} ~skip~0 := 0; {35837#false} is VALID [2022-04-14 18:39:37,650 INFO L290 TraceCheckUtils]: 82: Hoare triple {35837#false} assume !false; {35837#false} is VALID [2022-04-14 18:39:37,650 INFO L290 TraceCheckUtils]: 83: Hoare triple {35837#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); {35837#false} is VALID [2022-04-14 18:39:37,650 INFO L290 TraceCheckUtils]: 84: Hoare triple {35837#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,650 INFO L290 TraceCheckUtils]: 85: Hoare triple {35837#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,650 INFO L290 TraceCheckUtils]: 86: Hoare triple {35837#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,650 INFO L290 TraceCheckUtils]: 87: Hoare triple {35837#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 88: Hoare triple {35837#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 89: Hoare triple {35837#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 90: Hoare triple {35837#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 91: Hoare triple {35837#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 92: Hoare triple {35837#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 93: Hoare triple {35837#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 94: Hoare triple {35837#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 95: Hoare triple {35837#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 96: Hoare triple {35837#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 97: Hoare triple {35837#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 98: Hoare triple {35837#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 99: Hoare triple {35837#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 100: Hoare triple {35837#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 101: Hoare triple {35837#false} assume 8544 == #t~mem64;havoc #t~mem64; {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 102: Hoare triple {35837#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 103: Hoare triple {35837#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); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 104: Hoare triple {35837#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 105: Hoare triple {35837#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); {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 106: Hoare triple {35837#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; {35837#false} is VALID [2022-04-14 18:39:37,651 INFO L290 TraceCheckUtils]: 107: Hoare triple {35837#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; {35837#false} is VALID [2022-04-14 18:39:37,652 INFO L290 TraceCheckUtils]: 108: Hoare triple {35837#false} assume 8 == ~blastFlag~0; {35837#false} is VALID [2022-04-14 18:39:37,652 INFO L290 TraceCheckUtils]: 109: Hoare triple {35837#false} assume !false; {35837#false} is VALID [2022-04-14 18:39:37,652 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-14 18:39:37,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:39:37,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477630943] [2022-04-14 18:39:37,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477630943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:39:37,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:39:37,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:39:37,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211017016] [2022-04-14 18:39:37,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:39:37,654 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-14 18:39:37,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:39:37,655 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-14 18:39:37,714 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-14 18:39:37,714 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:39:37,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:39:37,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:39:37,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:39:37,715 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-14 18:39:39,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:39:41,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:39:43,867 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:39:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:44,838 INFO L93 Difference]: Finished difference Result 737 states and 1121 transitions. [2022-04-14 18:39:44,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:39:44,838 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-14 18:39:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:39:44,838 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-14 18:39:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2022-04-14 18:39:44,840 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-14 18:39:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2022-04-14 18:39:44,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 533 transitions. [2022-04-14 18:39:45,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 533 edges. 533 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:39:45,153 INFO L225 Difference]: With dead ends: 737 [2022-04-14 18:39:45,153 INFO L226 Difference]: Without dead ends: 409 [2022-04-14 18:39:45,153 INFO L912 BasicCegarLoop]: 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-14 18:39:45,154 INFO L913 BasicCegarLoop]: 192 mSDtfsCounter, 74 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 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, 4.1s IncrementalHoareTripleChecker+Time [2022-04-14 18:39:45,154 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 499 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-14 18:39:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-04-14 18:39:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 359. [2022-04-14 18:39:45,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:39:45,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 409 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-14 18:39:45,159 INFO L74 IsIncluded]: Start isIncluded. First operand 409 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-14 18:39:45,159 INFO L87 Difference]: Start difference. First operand 409 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-14 18:39:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:45,164 INFO L93 Difference]: Finished difference Result 409 states and 614 transitions. [2022-04-14 18:39:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 614 transitions. [2022-04-14 18:39:45,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:45,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:45,165 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 409 states. [2022-04-14 18:39:45,165 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 409 states. [2022-04-14 18:39:45,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:45,171 INFO L93 Difference]: Finished difference Result 409 states and 614 transitions. [2022-04-14 18:39:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 614 transitions. [2022-04-14 18:39:45,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:45,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:45,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:39:45,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:39:45,172 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-14 18:39:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 543 transitions. [2022-04-14 18:39:45,176 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 543 transitions. Word has length 110 [2022-04-14 18:39:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:39:45,177 INFO L478 AbstractCegarLoop]: Abstraction has 359 states and 543 transitions. [2022-04-14 18:39:45,177 INFO L479 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-14 18:39:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 543 transitions. [2022-04-14 18:39:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-14 18:39:45,177 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:39:45,177 INFO L499 BasicCegarLoop]: 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-14 18:39:45,177 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-14 18:39:45,178 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:39:45,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:39:45,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1830468437, now seen corresponding path program 1 times [2022-04-14 18:39:45,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:39:45,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426695868] [2022-04-14 18:39:45,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:39:45,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:39:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:45,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:39:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:45,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {37904#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {37897#true} is VALID [2022-04-14 18:39:45,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {37897#true} assume true; {37897#true} is VALID [2022-04-14 18:39:45,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37897#true} {37897#true} #690#return; {37897#true} is VALID [2022-04-14 18:39:45,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {37897#true} call ULTIMATE.init(); {37904#(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-14 18:39:45,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {37904#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {37897#true} is VALID [2022-04-14 18:39:45,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {37897#true} assume true; {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37897#true} {37897#true} #690#return; {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {37897#true} call #t~ret161 := main(); {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {37897#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; {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {37897#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L272 TraceCheckUtils]: 7: Hoare triple {37897#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {37897#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); {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {37897#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; {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {37897#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; {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {37897#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {37897#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {37897#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {37897#true} assume !false; {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {37897#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); {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {37897#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {37897#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {37897#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {37897#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {37897#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {37897#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {37897#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {37897#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {37897#true} assume 8464 == #t~mem55;havoc #t~mem55; {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {37897#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; {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {37897#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {37897#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); {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {37897#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); {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {37897#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {37897#true} ~skip~0 := 0; {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {37897#true} assume !false; {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {37897#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); {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {37897#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {37897#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 35: Hoare triple {37897#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {37897#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {37897#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {37897#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {37897#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {37897#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,293 INFO L290 TraceCheckUtils]: 41: Hoare triple {37897#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {37897#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {37897#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {37897#true} assume 8496 == #t~mem58;havoc #t~mem58; {37897#true} is VALID [2022-04-14 18:39:45,293 INFO L290 TraceCheckUtils]: 45: Hoare triple {37897#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {37897#true} is VALID [2022-04-14 18:39:45,293 INFO L290 TraceCheckUtils]: 46: Hoare triple {37897#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37897#true} is VALID [2022-04-14 18:39:45,293 INFO L290 TraceCheckUtils]: 47: Hoare triple {37897#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {37897#true} is VALID [2022-04-14 18:39:45,293 INFO L290 TraceCheckUtils]: 48: Hoare triple {37897#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {37902#(= (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); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {37902#(= (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; {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,296 INFO L290 TraceCheckUtils]: 54: Hoare triple {37902#(= (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); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,296 INFO L290 TraceCheckUtils]: 55: Hoare triple {37902#(= (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); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,296 INFO L290 TraceCheckUtils]: 56: Hoare triple {37902#(= (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); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {37902#(= (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); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,297 INFO L290 TraceCheckUtils]: 58: Hoare triple {37902#(= (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); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,297 INFO L290 TraceCheckUtils]: 59: Hoare triple {37902#(= (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); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,297 INFO L290 TraceCheckUtils]: 60: Hoare triple {37902#(= (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); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,298 INFO L290 TraceCheckUtils]: 61: Hoare triple {37902#(= (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); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,298 INFO L290 TraceCheckUtils]: 62: Hoare triple {37902#(= (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); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,298 INFO L290 TraceCheckUtils]: 63: Hoare triple {37902#(= (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); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,299 INFO L290 TraceCheckUtils]: 64: Hoare triple {37902#(= (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); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,299 INFO L290 TraceCheckUtils]: 65: Hoare triple {37902#(= (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); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,299 INFO L290 TraceCheckUtils]: 66: Hoare triple {37902#(= (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); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:39:45,300 INFO L290 TraceCheckUtils]: 67: Hoare triple {37902#(= (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); {37903#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-14 18:39:45,300 INFO L290 TraceCheckUtils]: 68: Hoare triple {37903#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,300 INFO L290 TraceCheckUtils]: 69: Hoare triple {37898#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,300 INFO L290 TraceCheckUtils]: 70: Hoare triple {37898#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,300 INFO L290 TraceCheckUtils]: 71: Hoare triple {37898#false} assume 8529 == #t~mem63;havoc #t~mem63; {37898#false} is VALID [2022-04-14 18:39:45,300 INFO L290 TraceCheckUtils]: 72: Hoare triple {37898#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); {37898#false} is VALID [2022-04-14 18:39:45,300 INFO L290 TraceCheckUtils]: 73: Hoare triple {37898#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; {37898#false} is VALID [2022-04-14 18:39:45,300 INFO L290 TraceCheckUtils]: 74: Hoare triple {37898#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); {37898#false} is VALID [2022-04-14 18:39:45,300 INFO L290 TraceCheckUtils]: 75: Hoare triple {37898#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {37898#false} is VALID [2022-04-14 18:39:45,300 INFO L290 TraceCheckUtils]: 76: Hoare triple {37898#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {37898#false} is VALID [2022-04-14 18:39:45,300 INFO L290 TraceCheckUtils]: 77: Hoare triple {37898#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {37898#false} is VALID [2022-04-14 18:39:45,300 INFO L290 TraceCheckUtils]: 78: Hoare triple {37898#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,300 INFO L290 TraceCheckUtils]: 79: Hoare triple {37898#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); {37898#false} is VALID [2022-04-14 18:39:45,300 INFO L290 TraceCheckUtils]: 80: Hoare triple {37898#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 81: Hoare triple {37898#false} ~skip~0 := 0; {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 82: Hoare triple {37898#false} assume !false; {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 83: Hoare triple {37898#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); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 84: Hoare triple {37898#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 85: Hoare triple {37898#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 86: Hoare triple {37898#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 87: Hoare triple {37898#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 88: Hoare triple {37898#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 89: Hoare triple {37898#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 90: Hoare triple {37898#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 91: Hoare triple {37898#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 92: Hoare triple {37898#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 93: Hoare triple {37898#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 94: Hoare triple {37898#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 95: Hoare triple {37898#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 96: Hoare triple {37898#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 97: Hoare triple {37898#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 98: Hoare triple {37898#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,301 INFO L290 TraceCheckUtils]: 99: Hoare triple {37898#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,302 INFO L290 TraceCheckUtils]: 100: Hoare triple {37898#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,302 INFO L290 TraceCheckUtils]: 101: Hoare triple {37898#false} assume 8544 == #t~mem64;havoc #t~mem64; {37898#false} is VALID [2022-04-14 18:39:45,302 INFO L290 TraceCheckUtils]: 102: Hoare triple {37898#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {37898#false} is VALID [2022-04-14 18:39:45,302 INFO L290 TraceCheckUtils]: 103: Hoare triple {37898#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); {37898#false} is VALID [2022-04-14 18:39:45,302 INFO L290 TraceCheckUtils]: 104: Hoare triple {37898#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {37898#false} is VALID [2022-04-14 18:39:45,302 INFO L290 TraceCheckUtils]: 105: Hoare triple {37898#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); {37898#false} is VALID [2022-04-14 18:39:45,302 INFO L290 TraceCheckUtils]: 106: Hoare triple {37898#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; {37898#false} is VALID [2022-04-14 18:39:45,302 INFO L290 TraceCheckUtils]: 107: Hoare triple {37898#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; {37898#false} is VALID [2022-04-14 18:39:45,302 INFO L290 TraceCheckUtils]: 108: Hoare triple {37898#false} assume 8 == ~blastFlag~0; {37898#false} is VALID [2022-04-14 18:39:45,302 INFO L290 TraceCheckUtils]: 109: Hoare triple {37898#false} assume !false; {37898#false} is VALID [2022-04-14 18:39:45,302 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-14 18:39:45,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:39:45,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426695868] [2022-04-14 18:39:45,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426695868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:39:45,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:39:45,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:39:45,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809935715] [2022-04-14 18:39:45,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:39:45,303 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-14 18:39:45,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:39:45,304 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-14 18:39:45,371 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-14 18:39:45,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:39:45,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:39:45,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:39:45,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:39:45,372 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-14 18:39:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:50,271 INFO L93 Difference]: Finished difference Result 738 states and 1123 transitions. [2022-04-14 18:39:50,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:39:50,271 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-14 18:39:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:39:50,271 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-14 18:39:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-14 18:39:50,273 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-14 18:39:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-14 18:39:50,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-14 18:39:50,553 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-14 18:39:50,559 INFO L225 Difference]: With dead ends: 738 [2022-04-14 18:39:50,559 INFO L226 Difference]: Without dead ends: 405 [2022-04-14 18:39:50,560 INFO L912 BasicCegarLoop]: 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-14 18:39:50,560 INFO L913 BasicCegarLoop]: 245 mSDtfsCounter, 36 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.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, 1.7s IncrementalHoareTripleChecker+Time [2022-04-14 18:39:50,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 603 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-14 18:39:50,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-14 18:39:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 383. [2022-04-14 18:39:50,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:39:50,566 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-14 18:39:50,566 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-14 18:39:50,566 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-14 18:39:50,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:50,572 INFO L93 Difference]: Finished difference Result 405 states and 609 transitions. [2022-04-14 18:39:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 609 transitions. [2022-04-14 18:39:50,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:50,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:50,573 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-14 18:39:50,573 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-14 18:39:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:50,579 INFO L93 Difference]: Finished difference Result 405 states and 609 transitions. [2022-04-14 18:39:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 609 transitions. [2022-04-14 18:39:50,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:50,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:50,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:39:50,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:39:50,580 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-14 18:39:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 579 transitions. [2022-04-14 18:39:50,585 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 579 transitions. Word has length 110 [2022-04-14 18:39:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:39:50,586 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 579 transitions. [2022-04-14 18:39:50,586 INFO L479 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-14 18:39:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 579 transitions. [2022-04-14 18:39:50,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-14 18:39:50,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:39:50,587 INFO L499 BasicCegarLoop]: 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-14 18:39:50,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-14 18:39:50,587 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:39:50,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:39:50,587 INFO L85 PathProgramCache]: Analyzing trace with hash -328927061, now seen corresponding path program 1 times [2022-04-14 18:39:50,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:39:50,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311988394] [2022-04-14 18:39:50,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:39:50,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:39:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:50,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:39:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:50,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {39980#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {39973#true} is VALID [2022-04-14 18:39:50,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {39973#true} assume true; {39973#true} is VALID [2022-04-14 18:39:50,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39973#true} {39973#true} #690#return; {39973#true} is VALID [2022-04-14 18:39:50,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {39973#true} call ULTIMATE.init(); {39980#(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-14 18:39:50,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {39980#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {39973#true} is VALID [2022-04-14 18:39:50,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {39973#true} assume true; {39973#true} is VALID [2022-04-14 18:39:50,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39973#true} {39973#true} #690#return; {39973#true} is VALID [2022-04-14 18:39:50,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {39973#true} call #t~ret161 := main(); {39973#true} is VALID [2022-04-14 18:39:50,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {39973#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; {39973#true} is VALID [2022-04-14 18:39:50,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {39973#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L272 TraceCheckUtils]: 7: Hoare triple {39973#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {39973#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); {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {39973#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; {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {39973#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; {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {39973#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {39973#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {39973#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {39973#true} assume !false; {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {39973#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); {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {39973#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {39973#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {39973#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {39973#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {39973#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {39973#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {39973#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {39973#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {39973#true} assume 8464 == #t~mem55;havoc #t~mem55; {39973#true} is VALID [2022-04-14 18:39:50,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {39973#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; {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {39973#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {39973#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); {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {39973#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); {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {39973#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {39973#true} ~skip~0 := 0; {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {39973#true} assume !false; {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {39973#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); {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {39973#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {39973#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {39973#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {39973#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {39973#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {39973#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {39973#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {39973#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {39973#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 42: Hoare triple {39973#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {39973#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 44: Hoare triple {39973#true} assume 8496 == #t~mem58;havoc #t~mem58; {39973#true} is VALID [2022-04-14 18:39:50,722 INFO L290 TraceCheckUtils]: 45: Hoare triple {39973#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {39973#true} is VALID [2022-04-14 18:39:50,723 INFO L290 TraceCheckUtils]: 46: Hoare triple {39973#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {39973#true} is VALID [2022-04-14 18:39:50,723 INFO L290 TraceCheckUtils]: 47: Hoare triple {39973#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {39973#true} is VALID [2022-04-14 18:39:50,723 INFO L290 TraceCheckUtils]: 48: Hoare triple {39973#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,724 INFO L290 TraceCheckUtils]: 50: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {39978#(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; {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,725 INFO L290 TraceCheckUtils]: 53: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,725 INFO L290 TraceCheckUtils]: 54: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,726 INFO L290 TraceCheckUtils]: 55: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,726 INFO L290 TraceCheckUtils]: 56: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,727 INFO L290 TraceCheckUtils]: 58: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,727 INFO L290 TraceCheckUtils]: 59: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,727 INFO L290 TraceCheckUtils]: 60: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,728 INFO L290 TraceCheckUtils]: 62: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,728 INFO L290 TraceCheckUtils]: 64: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,729 INFO L290 TraceCheckUtils]: 66: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,729 INFO L290 TraceCheckUtils]: 67: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,730 INFO L290 TraceCheckUtils]: 68: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,730 INFO L290 TraceCheckUtils]: 69: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,730 INFO L290 TraceCheckUtils]: 70: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,730 INFO L290 TraceCheckUtils]: 71: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,731 INFO L290 TraceCheckUtils]: 72: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,731 INFO L290 TraceCheckUtils]: 73: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,731 INFO L290 TraceCheckUtils]: 74: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,732 INFO L290 TraceCheckUtils]: 75: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,732 INFO L290 TraceCheckUtils]: 76: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,732 INFO L290 TraceCheckUtils]: 77: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,733 INFO L290 TraceCheckUtils]: 78: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,733 INFO L290 TraceCheckUtils]: 79: Hoare triple {39978#(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); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:39:50,733 INFO L290 TraceCheckUtils]: 80: Hoare triple {39978#(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); {39979#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-14 18:39:50,733 INFO L290 TraceCheckUtils]: 81: Hoare triple {39979#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {39974#false} is VALID [2022-04-14 18:39:50,733 INFO L290 TraceCheckUtils]: 82: Hoare triple {39974#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 83: Hoare triple {39974#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 84: Hoare triple {39974#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); {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 85: Hoare triple {39974#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); {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 86: Hoare triple {39974#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 87: Hoare triple {39974#false} ~skip~0 := 0; {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 88: Hoare triple {39974#false} assume !false; {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 89: Hoare triple {39974#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); {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 90: Hoare triple {39974#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 91: Hoare triple {39974#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 92: Hoare triple {39974#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 93: Hoare triple {39974#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 94: Hoare triple {39974#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 95: Hoare triple {39974#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 96: Hoare triple {39974#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 97: Hoare triple {39974#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,734 INFO L290 TraceCheckUtils]: 98: Hoare triple {39974#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,735 INFO L290 TraceCheckUtils]: 99: Hoare triple {39974#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,735 INFO L290 TraceCheckUtils]: 100: Hoare triple {39974#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,735 INFO L290 TraceCheckUtils]: 101: Hoare triple {39974#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,735 INFO L290 TraceCheckUtils]: 102: Hoare triple {39974#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 103: Hoare triple {39974#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 104: Hoare triple {39974#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 105: Hoare triple {39974#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 106: Hoare triple {39974#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 107: Hoare triple {39974#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 108: Hoare triple {39974#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 109: Hoare triple {39974#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 110: Hoare triple {39974#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 111: Hoare triple {39974#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 112: Hoare triple {39974#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 113: Hoare triple {39974#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 114: Hoare triple {39974#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 115: Hoare triple {39974#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 116: Hoare triple {39974#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 117: Hoare triple {39974#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 118: Hoare triple {39974#false} assume 8640 == #t~mem75;havoc #t~mem75; {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 119: Hoare triple {39974#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 120: Hoare triple {39974#false} assume 4 == ~blastFlag~0; {39974#false} is VALID [2022-04-14 18:39:50,736 INFO L290 TraceCheckUtils]: 121: Hoare triple {39974#false} assume !false; {39974#false} is VALID [2022-04-14 18:39:50,737 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-14 18:39:50,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:39:50,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311988394] [2022-04-14 18:39:50,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311988394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:39:50,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:39:50,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:39:50,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439146578] [2022-04-14 18:39:50,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:39:50,738 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-14 18:39:50,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:39:50,738 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-14 18:39:50,807 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-14 18:39:50,808 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:39:50,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:39:50,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:39:50,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:39:50,808 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-14 18:39:56,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:39:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:57,808 INFO L93 Difference]: Finished difference Result 857 states and 1301 transitions. [2022-04-14 18:39:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:39:57,808 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-14 18:39:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:39:57,808 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-14 18:39:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-14 18:39:57,810 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-14 18:39:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-14 18:39:57,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-14 18:39:58,174 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-14 18:39:58,182 INFO L225 Difference]: With dead ends: 857 [2022-04-14 18:39:58,182 INFO L226 Difference]: Without dead ends: 500 [2022-04-14 18:39:58,183 INFO L912 BasicCegarLoop]: 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-14 18:39:58,183 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 120 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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, 2.9s IncrementalHoareTripleChecker+Time [2022-04-14 18:39:58,183 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 346 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-14 18:39:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-04-14 18:39:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 420. [2022-04-14 18:39:58,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:39:58,189 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-14 18:39:58,189 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-14 18:39:58,190 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-14 18:39:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:58,197 INFO L93 Difference]: Finished difference Result 500 states and 750 transitions. [2022-04-14 18:39:58,197 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 750 transitions. [2022-04-14 18:39:58,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:58,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:58,198 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-14 18:39:58,199 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-14 18:39:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:39:58,207 INFO L93 Difference]: Finished difference Result 500 states and 750 transitions. [2022-04-14 18:39:58,207 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 750 transitions. [2022-04-14 18:39:58,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:39:58,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:39:58,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:39:58,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:39:58,208 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-14 18:39:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 637 transitions. [2022-04-14 18:39:58,214 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 637 transitions. Word has length 122 [2022-04-14 18:39:58,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:39:58,214 INFO L478 AbstractCegarLoop]: Abstraction has 420 states and 637 transitions. [2022-04-14 18:39:58,214 INFO L479 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-14 18:39:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 637 transitions. [2022-04-14 18:39:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-14 18:39:58,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:39:58,215 INFO L499 BasicCegarLoop]: 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-14 18:39:58,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-14 18:39:58,215 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:39:58,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:39:58,215 INFO L85 PathProgramCache]: Analyzing trace with hash 307351003, now seen corresponding path program 1 times [2022-04-14 18:39:58,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:39:58,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627766339] [2022-04-14 18:39:58,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:39:58,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:39:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:58,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:39:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:39:58,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {42423#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {42416#true} is VALID [2022-04-14 18:39:58,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {42416#true} assume true; {42416#true} is VALID [2022-04-14 18:39:58,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42416#true} {42416#true} #690#return; {42416#true} is VALID [2022-04-14 18:39:58,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {42416#true} call ULTIMATE.init(); {42423#(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-14 18:39:58,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {42423#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {42416#true} assume true; {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42416#true} {42416#true} #690#return; {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {42416#true} call #t~ret161 := main(); {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {42416#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; {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {42416#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L272 TraceCheckUtils]: 7: Hoare triple {42416#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {42416#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); {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {42416#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; {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {42416#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; {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {42416#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {42416#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {42416#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {42416#true} assume !false; {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {42416#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); {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {42416#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {42416#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {42416#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {42416#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {42416#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {42416#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {42416#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {42416#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {42416#true} assume 8464 == #t~mem55;havoc #t~mem55; {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {42416#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; {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {42416#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {42416#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); {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {42416#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); {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {42416#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {42416#true} ~skip~0 := 0; {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {42416#true} assume !false; {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {42416#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); {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {42416#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {42416#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {42416#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {42416#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {42416#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {42416#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {42416#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,326 INFO L290 TraceCheckUtils]: 40: Hoare triple {42416#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {42416#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,327 INFO L290 TraceCheckUtils]: 42: Hoare triple {42416#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,327 INFO L290 TraceCheckUtils]: 43: Hoare triple {42416#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,327 INFO L290 TraceCheckUtils]: 44: Hoare triple {42416#true} assume 8496 == #t~mem58;havoc #t~mem58; {42416#true} is VALID [2022-04-14 18:39:58,327 INFO L290 TraceCheckUtils]: 45: Hoare triple {42416#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {42416#true} is VALID [2022-04-14 18:39:58,327 INFO L290 TraceCheckUtils]: 46: Hoare triple {42416#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {42416#true} is VALID [2022-04-14 18:39:58,327 INFO L290 TraceCheckUtils]: 47: Hoare triple {42416#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {42416#true} is VALID [2022-04-14 18:39:58,327 INFO L290 TraceCheckUtils]: 48: Hoare triple {42416#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,328 INFO L290 TraceCheckUtils]: 49: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,328 INFO L290 TraceCheckUtils]: 50: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {42421#(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; {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,329 INFO L290 TraceCheckUtils]: 52: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,329 INFO L290 TraceCheckUtils]: 53: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,330 INFO L290 TraceCheckUtils]: 54: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,330 INFO L290 TraceCheckUtils]: 55: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,330 INFO L290 TraceCheckUtils]: 56: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,331 INFO L290 TraceCheckUtils]: 57: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,331 INFO L290 TraceCheckUtils]: 58: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,331 INFO L290 TraceCheckUtils]: 59: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,332 INFO L290 TraceCheckUtils]: 60: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,332 INFO L290 TraceCheckUtils]: 61: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,332 INFO L290 TraceCheckUtils]: 62: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,333 INFO L290 TraceCheckUtils]: 63: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,333 INFO L290 TraceCheckUtils]: 64: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,333 INFO L290 TraceCheckUtils]: 66: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,334 INFO L290 TraceCheckUtils]: 67: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,334 INFO L290 TraceCheckUtils]: 68: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,334 INFO L290 TraceCheckUtils]: 69: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,335 INFO L290 TraceCheckUtils]: 70: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,335 INFO L290 TraceCheckUtils]: 71: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,335 INFO L290 TraceCheckUtils]: 72: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,336 INFO L290 TraceCheckUtils]: 73: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,336 INFO L290 TraceCheckUtils]: 74: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,336 INFO L290 TraceCheckUtils]: 75: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,337 INFO L290 TraceCheckUtils]: 76: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,337 INFO L290 TraceCheckUtils]: 77: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,337 INFO L290 TraceCheckUtils]: 78: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,338 INFO L290 TraceCheckUtils]: 79: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,338 INFO L290 TraceCheckUtils]: 80: Hoare triple {42421#(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); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-14 18:39:58,338 INFO L290 TraceCheckUtils]: 81: Hoare triple {42421#(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); {42422#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-14 18:39:58,338 INFO L290 TraceCheckUtils]: 82: Hoare triple {42422#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {42417#false} is VALID [2022-04-14 18:39:58,338 INFO L290 TraceCheckUtils]: 83: Hoare triple {42417#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 84: Hoare triple {42417#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 85: Hoare triple {42417#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); {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 86: Hoare triple {42417#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); {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 87: Hoare triple {42417#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 88: Hoare triple {42417#false} ~skip~0 := 0; {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 89: Hoare triple {42417#false} assume !false; {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 90: Hoare triple {42417#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); {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 91: Hoare triple {42417#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 92: Hoare triple {42417#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 93: Hoare triple {42417#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 94: Hoare triple {42417#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 95: Hoare triple {42417#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 96: Hoare triple {42417#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 97: Hoare triple {42417#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 98: Hoare triple {42417#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 99: Hoare triple {42417#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 100: Hoare triple {42417#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 101: Hoare triple {42417#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,339 INFO L290 TraceCheckUtils]: 102: Hoare triple {42417#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 103: Hoare triple {42417#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 104: Hoare triple {42417#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 105: Hoare triple {42417#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 106: Hoare triple {42417#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 107: Hoare triple {42417#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 108: Hoare triple {42417#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 109: Hoare triple {42417#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 110: Hoare triple {42417#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 111: Hoare triple {42417#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 112: Hoare triple {42417#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 113: Hoare triple {42417#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 114: Hoare triple {42417#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 115: Hoare triple {42417#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 116: Hoare triple {42417#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 117: Hoare triple {42417#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 118: Hoare triple {42417#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 119: Hoare triple {42417#false} assume 8640 == #t~mem75;havoc #t~mem75; {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 120: Hoare triple {42417#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 121: Hoare triple {42417#false} assume 4 == ~blastFlag~0; {42417#false} is VALID [2022-04-14 18:39:58,340 INFO L290 TraceCheckUtils]: 122: Hoare triple {42417#false} assume !false; {42417#false} is VALID [2022-04-14 18:39:58,341 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-14 18:39:58,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:39:58,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627766339] [2022-04-14 18:39:58,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627766339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:39:58,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:39:58,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:39:58,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98084022] [2022-04-14 18:39:58,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:39:58,342 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-14 18:39:58,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:39:58,342 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-14 18:39:58,417 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-14 18:39:58,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:39:58,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:39:58,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:39:58,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:39:58,418 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-14 18:40:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:04,272 INFO L93 Difference]: Finished difference Result 891 states and 1353 transitions. [2022-04-14 18:40:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:40:04,273 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-14 18:40:04,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:40:04,273 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-14 18:40:04,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-14 18:40:04,275 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-14 18:40:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-14 18:40:04,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-14 18:40:04,640 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-14 18:40:04,649 INFO L225 Difference]: With dead ends: 891 [2022-04-14 18:40:04,649 INFO L226 Difference]: Without dead ends: 497 [2022-04-14 18:40:04,662 INFO L912 BasicCegarLoop]: 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-14 18:40:04,662 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 119 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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, 2.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:40:04,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 346 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 18:40:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-14 18:40:04,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 420. [2022-04-14 18:40:04,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:40:04,669 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-14 18:40:04,669 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-14 18:40:04,670 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-14 18:40:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:04,678 INFO L93 Difference]: Finished difference Result 497 states and 744 transitions. [2022-04-14 18:40:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 744 transitions. [2022-04-14 18:40:04,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:04,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:04,679 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-14 18:40:04,679 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-14 18:40:04,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:04,687 INFO L93 Difference]: Finished difference Result 497 states and 744 transitions. [2022-04-14 18:40:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 744 transitions. [2022-04-14 18:40:04,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:04,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:04,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:40:04,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:40:04,689 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-14 18:40:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 635 transitions. [2022-04-14 18:40:04,695 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 635 transitions. Word has length 123 [2022-04-14 18:40:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:40:04,696 INFO L478 AbstractCegarLoop]: Abstraction has 420 states and 635 transitions. [2022-04-14 18:40:04,697 INFO L479 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-14 18:40:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 635 transitions. [2022-04-14 18:40:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-14 18:40:04,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:40:04,697 INFO L499 BasicCegarLoop]: 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-14 18:40:04,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-14 18:40:04,697 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:40:04,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:40:04,698 INFO L85 PathProgramCache]: Analyzing trace with hash 863474282, now seen corresponding path program 1 times [2022-04-14 18:40:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:40:04,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78181411] [2022-04-14 18:40:04,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:40:04,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:40:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:04,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:40:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:04,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {44896#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {44889#true} is VALID [2022-04-14 18:40:04,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {44889#true} assume true; {44889#true} is VALID [2022-04-14 18:40:04,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44889#true} {44889#true} #690#return; {44889#true} is VALID [2022-04-14 18:40:04,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {44889#true} call ULTIMATE.init(); {44896#(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-14 18:40:04,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {44896#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {44889#true} is VALID [2022-04-14 18:40:04,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {44889#true} assume true; {44889#true} is VALID [2022-04-14 18:40:04,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44889#true} {44889#true} #690#return; {44889#true} is VALID [2022-04-14 18:40:04,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {44889#true} call #t~ret161 := main(); {44889#true} is VALID [2022-04-14 18:40:04,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {44889#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; {44889#true} is VALID [2022-04-14 18:40:04,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {44889#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,805 INFO L272 TraceCheckUtils]: 7: Hoare triple {44889#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {44889#true} is VALID [2022-04-14 18:40:04,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {44889#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); {44889#true} is VALID [2022-04-14 18:40:04,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {44889#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; {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {44889#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; {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {44889#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {44889#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {44889#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {44889#true} assume !false; {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {44889#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); {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {44889#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {44889#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {44889#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {44889#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {44889#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {44889#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {44889#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {44889#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {44889#true} assume 8464 == #t~mem55;havoc #t~mem55; {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {44889#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; {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {44889#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {44889#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); {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {44889#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); {44889#true} is VALID [2022-04-14 18:40:04,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {44889#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {44889#true} ~skip~0 := 0; {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {44889#true} assume !false; {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {44889#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); {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {44889#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {44889#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {44889#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {44889#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {44889#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {44889#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {44889#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {44889#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {44889#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {44889#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {44889#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {44889#true} assume 8496 == #t~mem58;havoc #t~mem58; {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {44889#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 46: Hoare triple {44889#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44889#true} is VALID [2022-04-14 18:40:04,807 INFO L290 TraceCheckUtils]: 47: Hoare triple {44889#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {44889#true} is VALID [2022-04-14 18:40:04,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {44889#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:04,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:04,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {44894#(= 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); {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:04,809 INFO L290 TraceCheckUtils]: 51: Hoare triple {44894#(= 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; {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:04,810 INFO L290 TraceCheckUtils]: 52: Hoare triple {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:04,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:04,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {44894#(= 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); {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:04,810 INFO L290 TraceCheckUtils]: 55: Hoare triple {44894#(= 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); {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:04,811 INFO L290 TraceCheckUtils]: 56: Hoare triple {44894#(= 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); {44895#(= |ssl3_accept_#t~mem49| 8656)} is VALID [2022-04-14 18:40:04,811 INFO L290 TraceCheckUtils]: 57: Hoare triple {44895#(= |ssl3_accept_#t~mem49| 8656)} assume 8192 == #t~mem49;havoc #t~mem49; {44890#false} is VALID [2022-04-14 18:40:04,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {44890#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,811 INFO L290 TraceCheckUtils]: 59: Hoare triple {44890#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44890#false} is VALID [2022-04-14 18:40:04,811 INFO L290 TraceCheckUtils]: 60: Hoare triple {44890#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,811 INFO L290 TraceCheckUtils]: 61: Hoare triple {44890#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); {44890#false} is VALID [2022-04-14 18:40:04,811 INFO L290 TraceCheckUtils]: 62: Hoare triple {44890#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {44890#false} is VALID [2022-04-14 18:40:04,811 INFO L290 TraceCheckUtils]: 63: Hoare triple {44890#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); {44890#false} is VALID [2022-04-14 18:40:04,811 INFO L290 TraceCheckUtils]: 64: Hoare triple {44890#false} assume 12292 != #t~mem85;havoc #t~mem85; {44890#false} is VALID [2022-04-14 18:40:04,811 INFO L290 TraceCheckUtils]: 65: Hoare triple {44890#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; {44890#false} is VALID [2022-04-14 18:40:04,811 INFO L290 TraceCheckUtils]: 66: Hoare triple {44890#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); {44890#false} is VALID [2022-04-14 18:40:04,811 INFO L290 TraceCheckUtils]: 67: Hoare triple {44890#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 68: Hoare triple {44890#false} ~skip~0 := 0; {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 69: Hoare triple {44890#false} assume !false; {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 70: Hoare triple {44890#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); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 71: Hoare triple {44890#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 72: Hoare triple {44890#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 73: Hoare triple {44890#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 74: Hoare triple {44890#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 75: Hoare triple {44890#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 76: Hoare triple {44890#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 77: Hoare triple {44890#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 78: Hoare triple {44890#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 79: Hoare triple {44890#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 80: Hoare triple {44890#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 81: Hoare triple {44890#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 82: Hoare triple {44890#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 83: Hoare triple {44890#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 84: Hoare triple {44890#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 85: Hoare triple {44890#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 86: Hoare triple {44890#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 87: Hoare triple {44890#false} assume 8529 == #t~mem63;havoc #t~mem63; {44890#false} is VALID [2022-04-14 18:40:04,812 INFO L290 TraceCheckUtils]: 88: Hoare triple {44890#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); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 89: Hoare triple {44890#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; {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 90: Hoare triple {44890#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); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 91: Hoare triple {44890#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 92: Hoare triple {44890#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 93: Hoare triple {44890#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 94: Hoare triple {44890#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 95: Hoare triple {44890#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); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 96: Hoare triple {44890#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 97: Hoare triple {44890#false} ~skip~0 := 0; {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 98: Hoare triple {44890#false} assume !false; {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 99: Hoare triple {44890#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); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 100: Hoare triple {44890#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 101: Hoare triple {44890#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 102: Hoare triple {44890#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 103: Hoare triple {44890#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 104: Hoare triple {44890#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 105: Hoare triple {44890#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 106: Hoare triple {44890#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 107: Hoare triple {44890#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 108: Hoare triple {44890#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,813 INFO L290 TraceCheckUtils]: 109: Hoare triple {44890#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 110: Hoare triple {44890#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 111: Hoare triple {44890#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 112: Hoare triple {44890#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 113: Hoare triple {44890#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 114: Hoare triple {44890#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 115: Hoare triple {44890#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 116: Hoare triple {44890#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 117: Hoare triple {44890#false} assume 8544 == #t~mem64;havoc #t~mem64; {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 118: Hoare triple {44890#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 119: Hoare triple {44890#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); {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 120: Hoare triple {44890#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 121: Hoare triple {44890#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); {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 122: Hoare triple {44890#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; {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 123: Hoare triple {44890#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; {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 124: Hoare triple {44890#false} assume 8 == ~blastFlag~0; {44890#false} is VALID [2022-04-14 18:40:04,814 INFO L290 TraceCheckUtils]: 125: Hoare triple {44890#false} assume !false; {44890#false} is VALID [2022-04-14 18:40:04,815 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-14 18:40:04,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:40:04,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78181411] [2022-04-14 18:40:04,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78181411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:40:04,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:40:04,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:40:04,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510332008] [2022-04-14 18:40:04,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:40:04,815 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-14 18:40:04,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:40:04,816 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-14 18:40:04,872 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-14 18:40:04,872 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:40:04,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:40:04,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:40:04,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:40:04,873 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-14 18:40:07,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:40:10,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:40:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:11,825 INFO L93 Difference]: Finished difference Result 860 states and 1303 transitions. [2022-04-14 18:40:11,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:40:11,825 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-14 18:40:11,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:40:11,825 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-14 18:40:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2022-04-14 18:40:11,827 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-14 18:40:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2022-04-14 18:40:11,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 524 transitions. [2022-04-14 18:40:12,135 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-14 18:40:12,142 INFO L225 Difference]: With dead ends: 860 [2022-04-14 18:40:12,143 INFO L226 Difference]: Without dead ends: 466 [2022-04-14 18:40:12,143 INFO L912 BasicCegarLoop]: 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-14 18:40:12,143 INFO L913 BasicCegarLoop]: 206 mSDtfsCounter, 85 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s 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, 4.0s IncrementalHoareTripleChecker+Time [2022-04-14 18:40:12,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 525 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-14 18:40:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-04-14 18:40:12,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 420. [2022-04-14 18:40:12,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:40:12,149 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-14 18:40:12,149 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-14 18:40:12,149 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-14 18:40:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:12,156 INFO L93 Difference]: Finished difference Result 466 states and 697 transitions. [2022-04-14 18:40:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 697 transitions. [2022-04-14 18:40:12,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:12,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:12,157 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-14 18:40:12,158 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-14 18:40:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:12,165 INFO L93 Difference]: Finished difference Result 466 states and 697 transitions. [2022-04-14 18:40:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 697 transitions. [2022-04-14 18:40:12,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:12,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:12,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:40:12,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:40:12,165 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-14 18:40:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 634 transitions. [2022-04-14 18:40:12,172 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 634 transitions. Word has length 126 [2022-04-14 18:40:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:40:12,172 INFO L478 AbstractCegarLoop]: Abstraction has 420 states and 634 transitions. [2022-04-14 18:40:12,172 INFO L479 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-14 18:40:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 634 transitions. [2022-04-14 18:40:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-14 18:40:12,173 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:40:12,173 INFO L499 BasicCegarLoop]: 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-14 18:40:12,173 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-14 18:40:12,173 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:40:12,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:40:12,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1702507944, now seen corresponding path program 1 times [2022-04-14 18:40:12,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:40:12,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300694469] [2022-04-14 18:40:12,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:40:12,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:40:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:12,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:40:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:12,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {47266#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {47259#true} is VALID [2022-04-14 18:40:12,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {47259#true} assume true; {47259#true} is VALID [2022-04-14 18:40:12,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47259#true} {47259#true} #690#return; {47259#true} is VALID [2022-04-14 18:40:12,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {47259#true} call ULTIMATE.init(); {47266#(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-14 18:40:12,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {47266#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {47259#true} is VALID [2022-04-14 18:40:12,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {47259#true} assume true; {47259#true} is VALID [2022-04-14 18:40:12,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47259#true} {47259#true} #690#return; {47259#true} is VALID [2022-04-14 18:40:12,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {47259#true} call #t~ret161 := main(); {47259#true} is VALID [2022-04-14 18:40:12,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {47259#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; {47259#true} is VALID [2022-04-14 18:40:12,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {47259#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,275 INFO L272 TraceCheckUtils]: 7: Hoare triple {47259#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {47259#true} is VALID [2022-04-14 18:40:12,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {47259#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); {47259#true} is VALID [2022-04-14 18:40:12,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {47259#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; {47259#true} is VALID [2022-04-14 18:40:12,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {47259#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; {47259#true} is VALID [2022-04-14 18:40:12,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {47259#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {47259#true} is VALID [2022-04-14 18:40:12,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {47259#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {47259#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {47259#true} assume !false; {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {47259#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); {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {47259#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {47259#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {47259#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {47259#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {47259#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {47259#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {47259#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {47259#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {47259#true} assume 8464 == #t~mem55;havoc #t~mem55; {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {47259#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; {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {47259#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {47259#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); {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {47259#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); {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {47259#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {47259#true} ~skip~0 := 0; {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {47259#true} assume !false; {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {47259#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); {47259#true} is VALID [2022-04-14 18:40:12,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {47259#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {47259#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {47259#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {47259#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {47259#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {47259#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,277 INFO L290 TraceCheckUtils]: 39: Hoare triple {47259#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,277 INFO L290 TraceCheckUtils]: 40: Hoare triple {47259#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,277 INFO L290 TraceCheckUtils]: 41: Hoare triple {47259#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {47259#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,277 INFO L290 TraceCheckUtils]: 43: Hoare triple {47259#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,277 INFO L290 TraceCheckUtils]: 44: Hoare triple {47259#true} assume 8496 == #t~mem58;havoc #t~mem58; {47259#true} is VALID [2022-04-14 18:40:12,277 INFO L290 TraceCheckUtils]: 45: Hoare triple {47259#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {47259#true} is VALID [2022-04-14 18:40:12,277 INFO L290 TraceCheckUtils]: 46: Hoare triple {47259#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {47259#true} is VALID [2022-04-14 18:40:12,277 INFO L290 TraceCheckUtils]: 47: Hoare triple {47259#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {47259#true} is VALID [2022-04-14 18:40:12,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {47259#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {47264#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:40:12,279 INFO L290 TraceCheckUtils]: 49: Hoare triple {47264#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {47264#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:40:12,279 INFO L290 TraceCheckUtils]: 50: Hoare triple {47264#(= (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); {47264#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:40:12,279 INFO L290 TraceCheckUtils]: 51: Hoare triple {47264#(= (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; {47264#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:40:12,279 INFO L290 TraceCheckUtils]: 52: Hoare triple {47264#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {47264#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:40:12,280 INFO L290 TraceCheckUtils]: 53: Hoare triple {47264#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {47264#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:40:12,280 INFO L290 TraceCheckUtils]: 54: Hoare triple {47264#(= (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); {47264#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:40:12,280 INFO L290 TraceCheckUtils]: 55: Hoare triple {47264#(= (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); {47264#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:40:12,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {47264#(= (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); {47265#(= |ssl3_accept_#t~mem49| 8512)} is VALID [2022-04-14 18:40:12,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {47265#(= |ssl3_accept_#t~mem49| 8512)} assume 8192 == #t~mem49;havoc #t~mem49; {47260#false} is VALID [2022-04-14 18:40:12,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {47260#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,281 INFO L290 TraceCheckUtils]: 59: Hoare triple {47260#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {47260#false} is VALID [2022-04-14 18:40:12,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {47260#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {47260#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); {47260#false} is VALID [2022-04-14 18:40:12,281 INFO L290 TraceCheckUtils]: 62: Hoare triple {47260#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {47260#false} is VALID [2022-04-14 18:40:12,281 INFO L290 TraceCheckUtils]: 63: Hoare triple {47260#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); {47260#false} is VALID [2022-04-14 18:40:12,281 INFO L290 TraceCheckUtils]: 64: Hoare triple {47260#false} assume 12292 != #t~mem85;havoc #t~mem85; {47260#false} is VALID [2022-04-14 18:40:12,281 INFO L290 TraceCheckUtils]: 65: Hoare triple {47260#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; {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 66: Hoare triple {47260#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); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 67: Hoare triple {47260#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 68: Hoare triple {47260#false} ~skip~0 := 0; {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 69: Hoare triple {47260#false} assume !false; {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 70: Hoare triple {47260#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); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 71: Hoare triple {47260#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 72: Hoare triple {47260#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 73: Hoare triple {47260#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 74: Hoare triple {47260#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 75: Hoare triple {47260#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 76: Hoare triple {47260#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 77: Hoare triple {47260#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 78: Hoare triple {47260#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 79: Hoare triple {47260#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 80: Hoare triple {47260#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 81: Hoare triple {47260#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 82: Hoare triple {47260#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 83: Hoare triple {47260#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 84: Hoare triple {47260#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 85: Hoare triple {47260#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,282 INFO L290 TraceCheckUtils]: 86: Hoare triple {47260#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 87: Hoare triple {47260#false} assume 8529 == #t~mem63;havoc #t~mem63; {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 88: Hoare triple {47260#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); {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 89: Hoare triple {47260#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; {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 90: Hoare triple {47260#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); {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 91: Hoare triple {47260#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 92: Hoare triple {47260#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 93: Hoare triple {47260#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 94: Hoare triple {47260#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 95: Hoare triple {47260#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); {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 96: Hoare triple {47260#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 97: Hoare triple {47260#false} ~skip~0 := 0; {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 98: Hoare triple {47260#false} assume !false; {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 99: Hoare triple {47260#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); {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 100: Hoare triple {47260#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 101: Hoare triple {47260#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 102: Hoare triple {47260#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 103: Hoare triple {47260#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,283 INFO L290 TraceCheckUtils]: 104: Hoare triple {47260#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 105: Hoare triple {47260#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 106: Hoare triple {47260#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 107: Hoare triple {47260#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 108: Hoare triple {47260#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 109: Hoare triple {47260#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 110: Hoare triple {47260#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 111: Hoare triple {47260#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 112: Hoare triple {47260#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 113: Hoare triple {47260#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 114: Hoare triple {47260#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 115: Hoare triple {47260#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 116: Hoare triple {47260#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 117: Hoare triple {47260#false} assume 8544 == #t~mem64;havoc #t~mem64; {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 118: Hoare triple {47260#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 119: Hoare triple {47260#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); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 120: Hoare triple {47260#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 121: Hoare triple {47260#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); {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 122: Hoare triple {47260#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; {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 123: Hoare triple {47260#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; {47260#false} is VALID [2022-04-14 18:40:12,284 INFO L290 TraceCheckUtils]: 124: Hoare triple {47260#false} assume 8 == ~blastFlag~0; {47260#false} is VALID [2022-04-14 18:40:12,285 INFO L290 TraceCheckUtils]: 125: Hoare triple {47260#false} assume !false; {47260#false} is VALID [2022-04-14 18:40:12,285 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-14 18:40:12,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:40:12,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300694469] [2022-04-14 18:40:12,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300694469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:40:12,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:40:12,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:40:12,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546643687] [2022-04-14 18:40:12,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:40:12,286 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-14 18:40:12,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:40:12,286 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-14 18:40:12,360 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-14 18:40:12,361 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:40:12,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:40:12,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:40:12,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:40:12,361 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-14 18:40:13,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:40:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:17,856 INFO L93 Difference]: Finished difference Result 836 states and 1268 transitions. [2022-04-14 18:40:17,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:40:17,856 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-14 18:40:17,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:40:17,856 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-14 18:40:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-14 18:40:17,858 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-14 18:40:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-14 18:40:17,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-14 18:40:18,139 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-14 18:40:18,146 INFO L225 Difference]: With dead ends: 836 [2022-04-14 18:40:18,147 INFO L226 Difference]: Without dead ends: 442 [2022-04-14 18:40:18,147 INFO L912 BasicCegarLoop]: 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-14 18:40:18,148 INFO L913 BasicCegarLoop]: 245 mSDtfsCounter, 46 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-14 18:40:18,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 603 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-14 18:40:18,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-04-14 18:40:18,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 420. [2022-04-14 18:40:18,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:40:18,153 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-14 18:40:18,154 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-14 18:40:18,154 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-14 18:40:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:18,161 INFO L93 Difference]: Finished difference Result 442 states and 663 transitions. [2022-04-14 18:40:18,161 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 663 transitions. [2022-04-14 18:40:18,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:18,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:18,162 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-14 18:40:18,162 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-14 18:40:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:18,169 INFO L93 Difference]: Finished difference Result 442 states and 663 transitions. [2022-04-14 18:40:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 663 transitions. [2022-04-14 18:40:18,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:18,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:18,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:40:18,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:40:18,170 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-14 18:40:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 633 transitions. [2022-04-14 18:40:18,177 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 633 transitions. Word has length 126 [2022-04-14 18:40:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:40:18,177 INFO L478 AbstractCegarLoop]: Abstraction has 420 states and 633 transitions. [2022-04-14 18:40:18,177 INFO L479 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-14 18:40:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 633 transitions. [2022-04-14 18:40:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-14 18:40:18,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:40:18,178 INFO L499 BasicCegarLoop]: 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-14 18:40:18,178 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-14 18:40:18,178 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:40:18,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:40:18,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1245189615, now seen corresponding path program 1 times [2022-04-14 18:40:18,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:40:18,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962270082] [2022-04-14 18:40:18,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:40:18,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:40:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:18,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:40:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:18,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {49559#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {49552#true} is VALID [2022-04-14 18:40:18,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {49552#true} assume true; {49552#true} is VALID [2022-04-14 18:40:18,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49552#true} {49552#true} #690#return; {49552#true} is VALID [2022-04-14 18:40:18,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {49552#true} call ULTIMATE.init(); {49559#(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-14 18:40:18,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {49559#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {49552#true} is VALID [2022-04-14 18:40:18,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {49552#true} assume true; {49552#true} is VALID [2022-04-14 18:40:18,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49552#true} {49552#true} #690#return; {49552#true} is VALID [2022-04-14 18:40:18,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {49552#true} call #t~ret161 := main(); {49552#true} is VALID [2022-04-14 18:40:18,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {49552#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; {49552#true} is VALID [2022-04-14 18:40:18,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {49552#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,299 INFO L272 TraceCheckUtils]: 7: Hoare triple {49552#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {49552#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); {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {49552#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; {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {49552#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; {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {49552#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {49552#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {49552#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {49552#true} assume !false; {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {49552#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); {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {49552#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {49552#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {49552#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {49552#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {49552#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {49552#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {49552#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {49552#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {49552#true} assume 8464 == #t~mem55;havoc #t~mem55; {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {49552#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; {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {49552#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {49552#true} is VALID [2022-04-14 18:40:18,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {49552#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); {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {49552#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); {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {49552#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {49552#true} ~skip~0 := 0; {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {49552#true} assume !false; {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {49552#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); {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {49552#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {49552#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {49552#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {49552#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {49552#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 38: Hoare triple {49552#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {49552#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {49552#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {49552#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {49552#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {49552#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {49552#true} assume 8496 == #t~mem58;havoc #t~mem58; {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {49552#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 46: Hoare triple {49552#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {49552#true} is VALID [2022-04-14 18:40:18,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {49552#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {49552#true} is VALID [2022-04-14 18:40:18,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {49552#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {49557#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:18,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {49557#(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); {49557#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:18,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {49557#(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); {49557#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:18,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {49557#(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; {49557#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:18,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {49557#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {49557#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:18,304 INFO L290 TraceCheckUtils]: 53: Hoare triple {49557#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {49557#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:18,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {49557#(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); {49557#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:18,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {49557#(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); {49557#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:18,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {49557#(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); {49557#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:18,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {49557#(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); {49557#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:18,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {49557#(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); {49558#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 59: Hoare triple {49558#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {49553#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {49553#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {49553#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {49553#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); {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 64: Hoare triple {49553#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {49553#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); {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 66: Hoare triple {49553#false} assume 12292 != #t~mem85;havoc #t~mem85; {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 67: Hoare triple {49553#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; {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 68: Hoare triple {49553#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); {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 69: Hoare triple {49553#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 70: Hoare triple {49553#false} ~skip~0 := 0; {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 71: Hoare triple {49553#false} assume !false; {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 72: Hoare triple {49553#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); {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 73: Hoare triple {49553#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 74: Hoare triple {49553#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 75: Hoare triple {49553#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 76: Hoare triple {49553#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 77: Hoare triple {49553#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,306 INFO L290 TraceCheckUtils]: 78: Hoare triple {49553#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 79: Hoare triple {49553#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 80: Hoare triple {49553#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 81: Hoare triple {49553#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 82: Hoare triple {49553#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 83: Hoare triple {49553#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 84: Hoare triple {49553#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 85: Hoare triple {49553#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 86: Hoare triple {49553#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 87: Hoare triple {49553#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 88: Hoare triple {49553#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 89: Hoare triple {49553#false} assume 8529 == #t~mem63;havoc #t~mem63; {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 90: Hoare triple {49553#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); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 91: Hoare triple {49553#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; {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 92: Hoare triple {49553#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); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 93: Hoare triple {49553#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 94: Hoare triple {49553#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 95: Hoare triple {49553#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 96: Hoare triple {49553#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 97: Hoare triple {49553#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); {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 98: Hoare triple {49553#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49553#false} is VALID [2022-04-14 18:40:18,307 INFO L290 TraceCheckUtils]: 99: Hoare triple {49553#false} ~skip~0 := 0; {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 100: Hoare triple {49553#false} assume !false; {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 101: Hoare triple {49553#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); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 102: Hoare triple {49553#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 103: Hoare triple {49553#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 104: Hoare triple {49553#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 105: Hoare triple {49553#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 106: Hoare triple {49553#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 107: Hoare triple {49553#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 108: Hoare triple {49553#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 109: Hoare triple {49553#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 110: Hoare triple {49553#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 111: Hoare triple {49553#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 112: Hoare triple {49553#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 113: Hoare triple {49553#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 114: Hoare triple {49553#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 115: Hoare triple {49553#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 116: Hoare triple {49553#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 117: Hoare triple {49553#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 118: Hoare triple {49553#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 119: Hoare triple {49553#false} assume 8544 == #t~mem64;havoc #t~mem64; {49553#false} is VALID [2022-04-14 18:40:18,308 INFO L290 TraceCheckUtils]: 120: Hoare triple {49553#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {49553#false} is VALID [2022-04-14 18:40:18,309 INFO L290 TraceCheckUtils]: 121: Hoare triple {49553#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); {49553#false} is VALID [2022-04-14 18:40:18,309 INFO L290 TraceCheckUtils]: 122: Hoare triple {49553#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {49553#false} is VALID [2022-04-14 18:40:18,309 INFO L290 TraceCheckUtils]: 123: Hoare triple {49553#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); {49553#false} is VALID [2022-04-14 18:40:18,309 INFO L290 TraceCheckUtils]: 124: Hoare triple {49553#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; {49553#false} is VALID [2022-04-14 18:40:18,309 INFO L290 TraceCheckUtils]: 125: Hoare triple {49553#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; {49553#false} is VALID [2022-04-14 18:40:18,309 INFO L290 TraceCheckUtils]: 126: Hoare triple {49553#false} assume 8 == ~blastFlag~0; {49553#false} is VALID [2022-04-14 18:40:18,309 INFO L290 TraceCheckUtils]: 127: Hoare triple {49553#false} assume !false; {49553#false} is VALID [2022-04-14 18:40:18,309 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-14 18:40:18,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:40:18,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962270082] [2022-04-14 18:40:18,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962270082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:40:18,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:40:18,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:40:18,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113616487] [2022-04-14 18:40:18,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:40:18,312 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-14 18:40:18,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:40:18,312 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-14 18:40:18,377 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-14 18:40:18,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:40:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:40:18,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:40:18,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:40:18,379 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-14 18:40:22,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:40:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:23,806 INFO L93 Difference]: Finished difference Result 891 states and 1345 transitions. [2022-04-14 18:40:23,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:40:23,806 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-14 18:40:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:40:23,807 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-14 18:40:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-14 18:40:23,809 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-14 18:40:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-14 18:40:23,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 587 transitions. [2022-04-14 18:40:24,172 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-14 18:40:24,180 INFO L225 Difference]: With dead ends: 891 [2022-04-14 18:40:24,180 INFO L226 Difference]: Without dead ends: 497 [2022-04-14 18:40:24,181 INFO L912 BasicCegarLoop]: 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-14 18:40:24,182 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 141 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-14 18:40:24,182 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 346 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-14 18:40:24,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-14 18:40:24,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 420. [2022-04-14 18:40:24,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:40:24,187 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-14 18:40:24,187 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-14 18:40:24,188 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-14 18:40:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:24,195 INFO L93 Difference]: Finished difference Result 497 states and 734 transitions. [2022-04-14 18:40:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 734 transitions. [2022-04-14 18:40:24,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:24,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:24,196 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-14 18:40:24,196 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-14 18:40:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:24,204 INFO L93 Difference]: Finished difference Result 497 states and 734 transitions. [2022-04-14 18:40:24,204 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 734 transitions. [2022-04-14 18:40:24,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:24,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:24,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:40:24,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:40:24,204 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-14 18:40:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 625 transitions. [2022-04-14 18:40:24,211 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 625 transitions. Word has length 128 [2022-04-14 18:40:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:40:24,211 INFO L478 AbstractCegarLoop]: Abstraction has 420 states and 625 transitions. [2022-04-14 18:40:24,211 INFO L479 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-14 18:40:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 625 transitions. [2022-04-14 18:40:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-14 18:40:24,212 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:40:24,212 INFO L499 BasicCegarLoop]: 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] [2022-04-14 18:40:24,212 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-14 18:40:24,212 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:40:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:40:24,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2114781281, now seen corresponding path program 1 times [2022-04-14 18:40:24,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:40:24,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245022951] [2022-04-14 18:40:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:40:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:40:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:40:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:24,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {52032#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {52025#true} is VALID [2022-04-14 18:40:24,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {52025#true} assume true; {52025#true} is VALID [2022-04-14 18:40:24,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52025#true} {52025#true} #690#return; {52025#true} is VALID [2022-04-14 18:40:24,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {52025#true} call ULTIMATE.init(); {52032#(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-14 18:40:24,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {52032#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {52025#true} assume true; {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52025#true} {52025#true} #690#return; {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {52025#true} call #t~ret161 := main(); {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {52025#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; {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {52025#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L272 TraceCheckUtils]: 7: Hoare triple {52025#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {52025#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); {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {52025#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; {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {52025#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; {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {52025#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {52025#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {52025#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {52025#true} assume !false; {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {52025#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); {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {52025#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {52025#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {52025#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {52025#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {52025#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {52025#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {52025#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {52025#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {52025#true} assume 8464 == #t~mem55;havoc #t~mem55; {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {52025#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; {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {52025#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {52025#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); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {52025#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); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {52025#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {52025#true} ~skip~0 := 0; {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {52025#true} assume !false; {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {52025#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); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {52025#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {52025#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {52025#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {52025#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {52025#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 38: Hoare triple {52025#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 39: Hoare triple {52025#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,311 INFO L290 TraceCheckUtils]: 40: Hoare triple {52025#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {52025#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {52025#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,312 INFO L290 TraceCheckUtils]: 43: Hoare triple {52025#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {52025#true} assume 8496 == #t~mem58;havoc #t~mem58; {52025#true} is VALID [2022-04-14 18:40:24,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {52025#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {52025#true} is VALID [2022-04-14 18:40:24,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {52025#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52025#true} is VALID [2022-04-14 18:40:24,312 INFO L290 TraceCheckUtils]: 47: Hoare triple {52025#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {52025#true} is VALID [2022-04-14 18:40:24,312 INFO L290 TraceCheckUtils]: 48: Hoare triple {52025#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,313 INFO L290 TraceCheckUtils]: 49: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,313 INFO L290 TraceCheckUtils]: 50: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,314 INFO L290 TraceCheckUtils]: 51: Hoare triple {52030#(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; {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,314 INFO L290 TraceCheckUtils]: 52: Hoare triple {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,314 INFO L290 TraceCheckUtils]: 53: Hoare triple {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,315 INFO L290 TraceCheckUtils]: 55: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,315 INFO L290 TraceCheckUtils]: 56: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,316 INFO L290 TraceCheckUtils]: 58: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,316 INFO L290 TraceCheckUtils]: 59: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,317 INFO L290 TraceCheckUtils]: 61: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,317 INFO L290 TraceCheckUtils]: 62: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,318 INFO L290 TraceCheckUtils]: 63: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,318 INFO L290 TraceCheckUtils]: 64: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,318 INFO L290 TraceCheckUtils]: 65: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,318 INFO L290 TraceCheckUtils]: 66: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,319 INFO L290 TraceCheckUtils]: 67: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,319 INFO L290 TraceCheckUtils]: 69: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,320 INFO L290 TraceCheckUtils]: 70: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,320 INFO L290 TraceCheckUtils]: 71: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,320 INFO L290 TraceCheckUtils]: 72: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,321 INFO L290 TraceCheckUtils]: 73: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,321 INFO L290 TraceCheckUtils]: 74: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,321 INFO L290 TraceCheckUtils]: 75: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,322 INFO L290 TraceCheckUtils]: 76: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,322 INFO L290 TraceCheckUtils]: 77: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,322 INFO L290 TraceCheckUtils]: 78: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,323 INFO L290 TraceCheckUtils]: 79: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,323 INFO L290 TraceCheckUtils]: 80: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,323 INFO L290 TraceCheckUtils]: 81: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,323 INFO L290 TraceCheckUtils]: 82: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,324 INFO L290 TraceCheckUtils]: 83: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,324 INFO L290 TraceCheckUtils]: 84: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,324 INFO L290 TraceCheckUtils]: 85: Hoare triple {52030#(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); {52030#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:24,325 INFO L290 TraceCheckUtils]: 86: Hoare triple {52030#(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); {52031#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-14 18:40:24,325 INFO L290 TraceCheckUtils]: 87: Hoare triple {52031#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {52026#false} is VALID [2022-04-14 18:40:24,325 INFO L290 TraceCheckUtils]: 88: Hoare triple {52026#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {52026#false} is VALID [2022-04-14 18:40:24,325 INFO L290 TraceCheckUtils]: 89: Hoare triple {52026#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {52026#false} is VALID [2022-04-14 18:40:24,325 INFO L290 TraceCheckUtils]: 90: Hoare triple {52026#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); {52026#false} is VALID [2022-04-14 18:40:24,325 INFO L290 TraceCheckUtils]: 91: Hoare triple {52026#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; {52026#false} is VALID [2022-04-14 18:40:24,325 INFO L290 TraceCheckUtils]: 92: Hoare triple {52026#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,325 INFO L290 TraceCheckUtils]: 93: Hoare triple {52026#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); {52026#false} is VALID [2022-04-14 18:40:24,325 INFO L290 TraceCheckUtils]: 94: Hoare triple {52026#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 95: Hoare triple {52026#false} ~skip~0 := 0; {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 96: Hoare triple {52026#false} assume !false; {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 97: Hoare triple {52026#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); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 98: Hoare triple {52026#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 99: Hoare triple {52026#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 100: Hoare triple {52026#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 101: Hoare triple {52026#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 102: Hoare triple {52026#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 103: Hoare triple {52026#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 104: Hoare triple {52026#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 105: Hoare triple {52026#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 106: Hoare triple {52026#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 107: Hoare triple {52026#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 108: Hoare triple {52026#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 109: Hoare triple {52026#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 110: Hoare triple {52026#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 111: Hoare triple {52026#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 112: Hoare triple {52026#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 113: Hoare triple {52026#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 114: Hoare triple {52026#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,326 INFO L290 TraceCheckUtils]: 115: Hoare triple {52026#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,327 INFO L290 TraceCheckUtils]: 116: Hoare triple {52026#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,327 INFO L290 TraceCheckUtils]: 117: Hoare triple {52026#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,327 INFO L290 TraceCheckUtils]: 118: Hoare triple {52026#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,327 INFO L290 TraceCheckUtils]: 119: Hoare triple {52026#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,327 INFO L290 TraceCheckUtils]: 120: Hoare triple {52026#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,327 INFO L290 TraceCheckUtils]: 121: Hoare triple {52026#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,327 INFO L290 TraceCheckUtils]: 122: Hoare triple {52026#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,327 INFO L290 TraceCheckUtils]: 123: Hoare triple {52026#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,327 INFO L290 TraceCheckUtils]: 124: Hoare triple {52026#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,327 INFO L290 TraceCheckUtils]: 125: Hoare triple {52026#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {52026#false} is VALID [2022-04-14 18:40:24,327 INFO L290 TraceCheckUtils]: 126: Hoare triple {52026#false} assume 8640 == #t~mem75;havoc #t~mem75; {52026#false} is VALID [2022-04-14 18:40:24,327 INFO L290 TraceCheckUtils]: 127: Hoare triple {52026#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {52026#false} is VALID [2022-04-14 18:40:24,327 INFO L290 TraceCheckUtils]: 128: Hoare triple {52026#false} assume 4 == ~blastFlag~0; {52026#false} is VALID [2022-04-14 18:40:24,327 INFO L290 TraceCheckUtils]: 129: Hoare triple {52026#false} assume !false; {52026#false} is VALID [2022-04-14 18:40:24,327 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-14 18:40:24,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:40:24,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245022951] [2022-04-14 18:40:24,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245022951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:40:24,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:40:24,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:40:24,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6647679] [2022-04-14 18:40:24,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:40:24,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-14 18:40:24,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:40:24,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:24,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:40:24,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:40:24,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:40:24,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:40:24,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:40:24,409 INFO L87 Difference]: Start difference. First operand 420 states and 625 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:28,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:40:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:30,677 INFO L93 Difference]: Finished difference Result 931 states and 1390 transitions. [2022-04-14 18:40:30,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:40:30,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-14 18:40:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:40:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-14 18:40:30,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:30,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-14 18:40:30,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-14 18:40:31,043 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-14 18:40:31,053 INFO L225 Difference]: With dead ends: 931 [2022-04-14 18:40:31,053 INFO L226 Difference]: Without dead ends: 537 [2022-04-14 18:40:31,053 INFO L912 BasicCegarLoop]: 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-14 18:40:31,054 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 111 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-14 18:40:31,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 347 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-14 18:40:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-04-14 18:40:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 463. [2022-04-14 18:40:31,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:40:31,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 537 states. Second operand has 463 states, 458 states have (on average 1.5) internal successors, (687), 458 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:31,060 INFO L74 IsIncluded]: Start isIncluded. First operand 537 states. Second operand has 463 states, 458 states have (on average 1.5) internal successors, (687), 458 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:31,060 INFO L87 Difference]: Start difference. First operand 537 states. Second operand has 463 states, 458 states have (on average 1.5) internal successors, (687), 458 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:31,069 INFO L93 Difference]: Finished difference Result 537 states and 794 transitions. [2022-04-14 18:40:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 794 transitions. [2022-04-14 18:40:31,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:31,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:31,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 463 states, 458 states have (on average 1.5) internal successors, (687), 458 states have internal predecessors, (687), 3 states have call successors, (3), 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-14 18:40:31,070 INFO L87 Difference]: Start difference. First operand has 463 states, 458 states have (on average 1.5) internal successors, (687), 458 states have internal predecessors, (687), 3 states have call successors, (3), 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-14 18:40:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:31,079 INFO L93 Difference]: Finished difference Result 537 states and 794 transitions. [2022-04-14 18:40:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 794 transitions. [2022-04-14 18:40:31,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:31,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:31,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:40:31,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:40:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 458 states have (on average 1.5) internal successors, (687), 458 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 691 transitions. [2022-04-14 18:40:31,087 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 691 transitions. Word has length 130 [2022-04-14 18:40:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:40:31,087 INFO L478 AbstractCegarLoop]: Abstraction has 463 states and 691 transitions. [2022-04-14 18:40:31,087 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 691 transitions. [2022-04-14 18:40:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-14 18:40:31,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:40:31,088 INFO L499 BasicCegarLoop]: 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-14 18:40:31,088 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-14 18:40:31,088 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:40:31,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:40:31,089 INFO L85 PathProgramCache]: Analyzing trace with hash -881988740, now seen corresponding path program 1 times [2022-04-14 18:40:31,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:40:31,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372025732] [2022-04-14 18:40:31,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:40:31,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:40:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:31,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:40:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:31,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {54672#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {54665#true} is VALID [2022-04-14 18:40:31,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {54665#true} assume true; {54665#true} is VALID [2022-04-14 18:40:31,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54665#true} {54665#true} #690#return; {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {54665#true} call ULTIMATE.init(); {54672#(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-14 18:40:31,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {54672#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {54665#true} assume true; {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54665#true} {54665#true} #690#return; {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {54665#true} call #t~ret161 := main(); {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {54665#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; {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {54665#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L272 TraceCheckUtils]: 7: Hoare triple {54665#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {54665#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); {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {54665#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; {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {54665#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; {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {54665#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {54665#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {54665#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {54665#true} assume !false; {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {54665#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); {54665#true} is VALID [2022-04-14 18:40:31,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {54665#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {54665#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {54665#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {54665#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {54665#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {54665#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {54665#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {54665#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {54665#true} assume 8464 == #t~mem55;havoc #t~mem55; {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {54665#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; {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {54665#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {54665#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); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {54665#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); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {54665#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {54665#true} ~skip~0 := 0; {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {54665#true} assume !false; {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {54665#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); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {54665#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {54665#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {54665#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {54665#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {54665#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,185 INFO L290 TraceCheckUtils]: 38: Hoare triple {54665#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {54665#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,186 INFO L290 TraceCheckUtils]: 40: Hoare triple {54665#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {54665#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {54665#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {54665#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {54665#true} assume 8496 == #t~mem58;havoc #t~mem58; {54665#true} is VALID [2022-04-14 18:40:31,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {54665#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {54665#true} is VALID [2022-04-14 18:40:31,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {54665#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {54665#true} is VALID [2022-04-14 18:40:31,186 INFO L290 TraceCheckUtils]: 47: Hoare triple {54665#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {54665#true} is VALID [2022-04-14 18:40:31,186 INFO L290 TraceCheckUtils]: 48: Hoare triple {54665#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,187 INFO L290 TraceCheckUtils]: 50: Hoare triple {54670#(= 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); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,188 INFO L290 TraceCheckUtils]: 51: Hoare triple {54670#(= 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; {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,188 INFO L290 TraceCheckUtils]: 52: Hoare triple {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,188 INFO L290 TraceCheckUtils]: 53: Hoare triple {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,189 INFO L290 TraceCheckUtils]: 54: Hoare triple {54670#(= 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); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,189 INFO L290 TraceCheckUtils]: 55: Hoare triple {54670#(= 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); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,189 INFO L290 TraceCheckUtils]: 56: Hoare triple {54670#(= 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); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,189 INFO L290 TraceCheckUtils]: 57: Hoare triple {54670#(= 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); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,190 INFO L290 TraceCheckUtils]: 58: Hoare triple {54670#(= 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); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,190 INFO L290 TraceCheckUtils]: 59: Hoare triple {54670#(= 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); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,190 INFO L290 TraceCheckUtils]: 60: Hoare triple {54670#(= 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); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,191 INFO L290 TraceCheckUtils]: 61: Hoare triple {54670#(= 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); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,191 INFO L290 TraceCheckUtils]: 62: Hoare triple {54670#(= 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); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,191 INFO L290 TraceCheckUtils]: 63: Hoare triple {54670#(= 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); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,191 INFO L290 TraceCheckUtils]: 64: Hoare triple {54670#(= 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); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,192 INFO L290 TraceCheckUtils]: 65: Hoare triple {54670#(= 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); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,192 INFO L290 TraceCheckUtils]: 66: Hoare triple {54670#(= 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); {54670#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:40:31,192 INFO L290 TraceCheckUtils]: 67: Hoare triple {54670#(= 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); {54671#(= |ssl3_accept_#t~mem60| 8656)} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 68: Hoare triple {54671#(= |ssl3_accept_#t~mem60| 8656)} assume 8512 == #t~mem60;havoc #t~mem60; {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 69: Hoare triple {54666#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); {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 70: Hoare triple {54666#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; {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 71: Hoare triple {54666#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 72: Hoare triple {54666#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); {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 73: Hoare triple {54666#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 74: Hoare triple {54666#false} ~skip~0 := 0; {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 75: Hoare triple {54666#false} assume !false; {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 76: Hoare triple {54666#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); {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 77: Hoare triple {54666#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 78: Hoare triple {54666#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 79: Hoare triple {54666#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 80: Hoare triple {54666#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 81: Hoare triple {54666#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 82: Hoare triple {54666#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 83: Hoare triple {54666#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,193 INFO L290 TraceCheckUtils]: 84: Hoare triple {54666#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 85: Hoare triple {54666#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 86: Hoare triple {54666#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 87: Hoare triple {54666#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 88: Hoare triple {54666#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 89: Hoare triple {54666#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 90: Hoare triple {54666#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 91: Hoare triple {54666#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 92: Hoare triple {54666#false} assume 8528 == #t~mem62;havoc #t~mem62; {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 93: Hoare triple {54666#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); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 94: Hoare triple {54666#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; {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 95: Hoare triple {54666#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); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 96: Hoare triple {54666#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 97: Hoare triple {54666#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 98: Hoare triple {54666#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 99: Hoare triple {54666#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 100: Hoare triple {54666#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); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 101: Hoare triple {54666#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 102: Hoare triple {54666#false} ~skip~0 := 0; {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 103: Hoare triple {54666#false} assume !false; {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 104: Hoare triple {54666#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); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 105: Hoare triple {54666#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,194 INFO L290 TraceCheckUtils]: 106: Hoare triple {54666#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 107: Hoare triple {54666#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 108: Hoare triple {54666#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 109: Hoare triple {54666#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 110: Hoare triple {54666#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 111: Hoare triple {54666#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 112: Hoare triple {54666#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 113: Hoare triple {54666#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 114: Hoare triple {54666#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 115: Hoare triple {54666#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 116: Hoare triple {54666#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 117: Hoare triple {54666#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 118: Hoare triple {54666#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 119: Hoare triple {54666#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 120: Hoare triple {54666#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 121: Hoare triple {54666#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 122: Hoare triple {54666#false} assume 8544 == #t~mem64;havoc #t~mem64; {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 123: Hoare triple {54666#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 124: Hoare triple {54666#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); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 125: Hoare triple {54666#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 126: Hoare triple {54666#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); {54666#false} is VALID [2022-04-14 18:40:31,195 INFO L290 TraceCheckUtils]: 127: Hoare triple {54666#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; {54666#false} is VALID [2022-04-14 18:40:31,196 INFO L290 TraceCheckUtils]: 128: Hoare triple {54666#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; {54666#false} is VALID [2022-04-14 18:40:31,196 INFO L290 TraceCheckUtils]: 129: Hoare triple {54666#false} assume 8 == ~blastFlag~0; {54666#false} is VALID [2022-04-14 18:40:31,196 INFO L290 TraceCheckUtils]: 130: Hoare triple {54666#false} assume !false; {54666#false} is VALID [2022-04-14 18:40:31,196 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-14 18:40:31,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:40:31,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372025732] [2022-04-14 18:40:31,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372025732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:40:31,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:40:31,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:40:31,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401357889] [2022-04-14 18:40:31,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:40:31,197 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-14 18:40:31,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:40:31,197 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-14 18:40:31,256 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-14 18:40:31,256 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:40:31,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:40:31,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:40:31,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:40:31,257 INFO L87 Difference]: Start difference. First operand 463 states and 691 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-14 18:40:36,138 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-14 18:40:37,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:37,117 INFO L93 Difference]: Finished difference Result 936 states and 1401 transitions. [2022-04-14 18:40:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:40:37,117 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-14 18:40:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:40:37,117 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-14 18:40:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2022-04-14 18:40:37,119 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-14 18:40:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2022-04-14 18:40:37,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 508 transitions. [2022-04-14 18:40:37,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:40:37,424 INFO L225 Difference]: With dead ends: 936 [2022-04-14 18:40:37,424 INFO L226 Difference]: Without dead ends: 499 [2022-04-14 18:40:37,425 INFO L912 BasicCegarLoop]: 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-14 18:40:37,425 INFO L913 BasicCegarLoop]: 207 mSDtfsCounter, 64 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:40:37,425 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 529 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-14 18:40:37,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-14 18:40:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 463. [2022-04-14 18:40:37,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:40:37,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 463 states, 458 states have (on average 1.497816593886463) internal successors, (686), 458 states have internal predecessors, (686), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:37,431 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 463 states, 458 states have (on average 1.497816593886463) internal successors, (686), 458 states have internal predecessors, (686), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:37,432 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 463 states, 458 states have (on average 1.497816593886463) internal successors, (686), 458 states have internal predecessors, (686), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:37,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:37,439 INFO L93 Difference]: Finished difference Result 499 states and 739 transitions. [2022-04-14 18:40:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 739 transitions. [2022-04-14 18:40:37,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:37,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:37,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 463 states, 458 states have (on average 1.497816593886463) internal successors, (686), 458 states have internal predecessors, (686), 3 states have call successors, (3), 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 499 states. [2022-04-14 18:40:37,441 INFO L87 Difference]: Start difference. First operand has 463 states, 458 states have (on average 1.497816593886463) internal successors, (686), 458 states have internal predecessors, (686), 3 states have call successors, (3), 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 499 states. [2022-04-14 18:40:37,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:37,448 INFO L93 Difference]: Finished difference Result 499 states and 739 transitions. [2022-04-14 18:40:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 739 transitions. [2022-04-14 18:40:37,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:37,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:37,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:40:37,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:40:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 458 states have (on average 1.497816593886463) internal successors, (686), 458 states have internal predecessors, (686), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 690 transitions. [2022-04-14 18:40:37,456 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 690 transitions. Word has length 131 [2022-04-14 18:40:37,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:40:37,457 INFO L478 AbstractCegarLoop]: Abstraction has 463 states and 690 transitions. [2022-04-14 18:40:37,457 INFO L479 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-14 18:40:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 690 transitions. [2022-04-14 18:40:37,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-14 18:40:37,457 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:40:37,458 INFO L499 BasicCegarLoop]: 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-14 18:40:37,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-14 18:40:37,458 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:40:37,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:40:37,458 INFO L85 PathProgramCache]: Analyzing trace with hash 314988207, now seen corresponding path program 1 times [2022-04-14 18:40:37,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:40:37,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333341107] [2022-04-14 18:40:37,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:40:37,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:40:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:37,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:40:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:37,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {57232#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {57225#true} is VALID [2022-04-14 18:40:37,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {57225#true} assume true; {57225#true} is VALID [2022-04-14 18:40:37,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57225#true} {57225#true} #690#return; {57225#true} is VALID [2022-04-14 18:40:37,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {57225#true} call ULTIMATE.init(); {57232#(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-14 18:40:37,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {57232#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {57225#true} is VALID [2022-04-14 18:40:37,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {57225#true} assume true; {57225#true} is VALID [2022-04-14 18:40:37,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57225#true} {57225#true} #690#return; {57225#true} is VALID [2022-04-14 18:40:37,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {57225#true} call #t~ret161 := main(); {57225#true} is VALID [2022-04-14 18:40:37,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {57225#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; {57225#true} is VALID [2022-04-14 18:40:37,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {57225#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,557 INFO L272 TraceCheckUtils]: 7: Hoare triple {57225#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {57225#true} is VALID [2022-04-14 18:40:37,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {57225#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); {57225#true} is VALID [2022-04-14 18:40:37,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {57225#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; {57225#true} is VALID [2022-04-14 18:40:37,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {57225#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; {57225#true} is VALID [2022-04-14 18:40:37,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {57225#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {57225#true} is VALID [2022-04-14 18:40:37,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {57225#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {57225#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {57225#true} assume !false; {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {57225#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); {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {57225#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {57225#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {57225#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {57225#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {57225#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {57225#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {57225#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {57225#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {57225#true} assume 8464 == #t~mem55;havoc #t~mem55; {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {57225#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; {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {57225#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {57225#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); {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {57225#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); {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {57225#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {57225#true} ~skip~0 := 0; {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {57225#true} assume !false; {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {57225#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); {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {57225#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {57225#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {57225#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {57225#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {57225#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {57225#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {57225#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {57225#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,559 INFO L290 TraceCheckUtils]: 41: Hoare triple {57225#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,559 INFO L290 TraceCheckUtils]: 42: Hoare triple {57225#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {57225#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {57225#true} assume 8496 == #t~mem58;havoc #t~mem58; {57225#true} is VALID [2022-04-14 18:40:37,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {57225#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {57225#true} is VALID [2022-04-14 18:40:37,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {57225#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {57225#true} is VALID [2022-04-14 18:40:37,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {57225#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {57225#true} is VALID [2022-04-14 18:40:37,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {57225#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,561 INFO L290 TraceCheckUtils]: 50: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,561 INFO L290 TraceCheckUtils]: 51: Hoare triple {57230#(not (= 8673 (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; {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,561 INFO L290 TraceCheckUtils]: 52: Hoare triple {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,562 INFO L290 TraceCheckUtils]: 53: Hoare triple {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,562 INFO L290 TraceCheckUtils]: 55: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,563 INFO L290 TraceCheckUtils]: 56: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,563 INFO L290 TraceCheckUtils]: 57: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,563 INFO L290 TraceCheckUtils]: 58: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,563 INFO L290 TraceCheckUtils]: 59: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,564 INFO L290 TraceCheckUtils]: 60: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,564 INFO L290 TraceCheckUtils]: 61: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,564 INFO L290 TraceCheckUtils]: 62: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,565 INFO L290 TraceCheckUtils]: 63: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,565 INFO L290 TraceCheckUtils]: 64: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,565 INFO L290 TraceCheckUtils]: 65: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,566 INFO L290 TraceCheckUtils]: 66: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,566 INFO L290 TraceCheckUtils]: 67: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,566 INFO L290 TraceCheckUtils]: 68: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,567 INFO L290 TraceCheckUtils]: 69: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,567 INFO L290 TraceCheckUtils]: 70: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,567 INFO L290 TraceCheckUtils]: 71: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,567 INFO L290 TraceCheckUtils]: 72: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,568 INFO L290 TraceCheckUtils]: 73: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,568 INFO L290 TraceCheckUtils]: 74: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,568 INFO L290 TraceCheckUtils]: 75: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,569 INFO L290 TraceCheckUtils]: 76: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,569 INFO L290 TraceCheckUtils]: 77: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,569 INFO L290 TraceCheckUtils]: 78: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,570 INFO L290 TraceCheckUtils]: 79: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,570 INFO L290 TraceCheckUtils]: 80: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,570 INFO L290 TraceCheckUtils]: 81: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,571 INFO L290 TraceCheckUtils]: 82: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,571 INFO L290 TraceCheckUtils]: 83: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,571 INFO L290 TraceCheckUtils]: 84: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,572 INFO L290 TraceCheckUtils]: 85: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,572 INFO L290 TraceCheckUtils]: 86: Hoare triple {57230#(not (= 8673 (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); {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:40:37,572 INFO L290 TraceCheckUtils]: 87: Hoare triple {57230#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {57231#(not (= |ssl3_accept_#t~mem80| 8673))} is VALID [2022-04-14 18:40:37,572 INFO L290 TraceCheckUtils]: 88: Hoare triple {57231#(not (= |ssl3_accept_#t~mem80| 8673))} assume 8673 == #t~mem80;havoc #t~mem80; {57226#false} is VALID [2022-04-14 18:40:37,572 INFO L290 TraceCheckUtils]: 89: Hoare triple {57226#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 90: Hoare triple {57226#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 91: Hoare triple {57226#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); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 92: Hoare triple {57226#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; {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 93: Hoare triple {57226#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 94: Hoare triple {57226#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); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 95: Hoare triple {57226#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 96: Hoare triple {57226#false} ~skip~0 := 0; {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 97: Hoare triple {57226#false} assume !false; {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 98: Hoare triple {57226#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); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 99: Hoare triple {57226#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 100: Hoare triple {57226#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 101: Hoare triple {57226#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 102: Hoare triple {57226#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 103: Hoare triple {57226#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 104: Hoare triple {57226#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 105: Hoare triple {57226#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 106: Hoare triple {57226#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 107: Hoare triple {57226#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 108: Hoare triple {57226#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 109: Hoare triple {57226#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,573 INFO L290 TraceCheckUtils]: 110: Hoare triple {57226#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 111: Hoare triple {57226#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 112: Hoare triple {57226#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 113: Hoare triple {57226#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 114: Hoare triple {57226#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 115: Hoare triple {57226#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 116: Hoare triple {57226#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 117: Hoare triple {57226#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 118: Hoare triple {57226#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 119: Hoare triple {57226#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 120: Hoare triple {57226#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 121: Hoare triple {57226#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 122: Hoare triple {57226#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 123: Hoare triple {57226#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 124: Hoare triple {57226#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 125: Hoare triple {57226#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 126: Hoare triple {57226#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 127: Hoare triple {57226#false} assume 8640 == #t~mem75;havoc #t~mem75; {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 128: Hoare triple {57226#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 129: Hoare triple {57226#false} assume 4 == ~blastFlag~0; {57226#false} is VALID [2022-04-14 18:40:37,574 INFO L290 TraceCheckUtils]: 130: Hoare triple {57226#false} assume !false; {57226#false} is VALID [2022-04-14 18:40:37,575 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-14 18:40:37,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:40:37,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333341107] [2022-04-14 18:40:37,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333341107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:40:37,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:40:37,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:40:37,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526919559] [2022-04-14 18:40:37,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:40:37,576 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-14 18:40:37,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:40:37,576 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-14 18:40:37,661 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-14 18:40:37,661 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:40:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:40:37,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:40:37,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:40:37,662 INFO L87 Difference]: Start difference. First operand 463 states and 690 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-14 18:40:41,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:40:45,186 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-14 18:40:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:46,247 INFO L93 Difference]: Finished difference Result 977 states and 1459 transitions. [2022-04-14 18:40:46,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:40:46,247 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-14 18:40:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:40:46,248 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-14 18:40:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-14 18:40:46,250 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-14 18:40:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-14 18:40:46,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-14 18:40:46,625 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-14 18:40:46,635 INFO L225 Difference]: With dead ends: 977 [2022-04-14 18:40:46,635 INFO L226 Difference]: Without dead ends: 538 [2022-04-14 18:40:46,636 INFO L912 BasicCegarLoop]: 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-14 18:40:46,636 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 112 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 58 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-14 18:40:46,636 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 360 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 479 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2022-04-14 18:40:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-04-14 18:40:46,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 465. [2022-04-14 18:40:46,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:40:46,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 538 states. Second operand has 465 states, 460 states have (on average 1.4978260869565216) internal successors, (689), 460 states have internal predecessors, (689), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:46,643 INFO L74 IsIncluded]: Start isIncluded. First operand 538 states. Second operand has 465 states, 460 states have (on average 1.4978260869565216) internal successors, (689), 460 states have internal predecessors, (689), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:46,643 INFO L87 Difference]: Start difference. First operand 538 states. Second operand has 465 states, 460 states have (on average 1.4978260869565216) internal successors, (689), 460 states have internal predecessors, (689), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:46,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:46,652 INFO L93 Difference]: Finished difference Result 538 states and 795 transitions. [2022-04-14 18:40:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 795 transitions. [2022-04-14 18:40:46,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:46,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:46,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 465 states, 460 states have (on average 1.4978260869565216) internal successors, (689), 460 states have internal predecessors, (689), 3 states have call successors, (3), 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 538 states. [2022-04-14 18:40:46,653 INFO L87 Difference]: Start difference. First operand has 465 states, 460 states have (on average 1.4978260869565216) internal successors, (689), 460 states have internal predecessors, (689), 3 states have call successors, (3), 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 538 states. [2022-04-14 18:40:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:46,662 INFO L93 Difference]: Finished difference Result 538 states and 795 transitions. [2022-04-14 18:40:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 795 transitions. [2022-04-14 18:40:46,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:46,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:46,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:40:46,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:40:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 460 states have (on average 1.4978260869565216) internal successors, (689), 460 states have internal predecessors, (689), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 693 transitions. [2022-04-14 18:40:46,670 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 693 transitions. Word has length 131 [2022-04-14 18:40:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:40:46,670 INFO L478 AbstractCegarLoop]: Abstraction has 465 states and 693 transitions. [2022-04-14 18:40:46,671 INFO L479 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-14 18:40:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 693 transitions. [2022-04-14 18:40:46,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-14 18:40:46,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:40:46,671 INFO L499 BasicCegarLoop]: 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-14 18:40:46,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-14 18:40:46,671 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:40:46,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:40:46,672 INFO L85 PathProgramCache]: Analyzing trace with hash 442867454, now seen corresponding path program 1 times [2022-04-14 18:40:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:40:46,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516281492] [2022-04-14 18:40:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:40:46,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:40:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:46,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:40:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:46,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {59923#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {59917#true} is VALID [2022-04-14 18:40:46,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {59917#true} assume true; {59917#true} is VALID [2022-04-14 18:40:46,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59917#true} {59917#true} #690#return; {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {59917#true} call ULTIMATE.init(); {59923#(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-14 18:40:46,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {59923#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {59917#true} assume true; {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59917#true} {59917#true} #690#return; {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {59917#true} call #t~ret161 := main(); {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {59917#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; {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {59917#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L272 TraceCheckUtils]: 7: Hoare triple {59917#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {59917#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); {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {59917#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; {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {59917#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; {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {59917#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {59917#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {59917#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {59917#true} assume !false; {59917#true} is VALID [2022-04-14 18:40:46,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {59917#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); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {59917#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {59917#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {59917#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {59917#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {59917#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {59917#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {59917#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {59917#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {59917#true} assume 8464 == #t~mem55;havoc #t~mem55; {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {59917#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; {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {59917#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {59917#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); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {59917#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); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {59917#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {59917#true} ~skip~0 := 0; {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {59917#true} assume !false; {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {59917#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); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {59917#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {59917#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {59917#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {59917#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {59917#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {59917#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,789 INFO L290 TraceCheckUtils]: 39: Hoare triple {59917#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,789 INFO L290 TraceCheckUtils]: 40: Hoare triple {59917#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {59917#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,789 INFO L290 TraceCheckUtils]: 42: Hoare triple {59917#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {59917#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59917#true} is VALID [2022-04-14 18:40:46,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {59917#true} assume 8496 == #t~mem58;havoc #t~mem58; {59917#true} is VALID [2022-04-14 18:40:46,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {59917#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {59917#true} is VALID [2022-04-14 18:40:46,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {59917#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,790 INFO L290 TraceCheckUtils]: 48: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,790 INFO L290 TraceCheckUtils]: 49: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,790 INFO L290 TraceCheckUtils]: 50: Hoare triple {59922#(= 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); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,790 INFO L290 TraceCheckUtils]: 51: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,790 INFO L290 TraceCheckUtils]: 52: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,791 INFO L290 TraceCheckUtils]: 53: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,791 INFO L290 TraceCheckUtils]: 54: Hoare triple {59922#(= 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); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,791 INFO L290 TraceCheckUtils]: 55: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,791 INFO L290 TraceCheckUtils]: 56: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,791 INFO L290 TraceCheckUtils]: 57: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,792 INFO L290 TraceCheckUtils]: 58: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,792 INFO L290 TraceCheckUtils]: 59: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,792 INFO L290 TraceCheckUtils]: 60: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,792 INFO L290 TraceCheckUtils]: 61: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,793 INFO L290 TraceCheckUtils]: 62: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,793 INFO L290 TraceCheckUtils]: 63: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,793 INFO L290 TraceCheckUtils]: 64: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,793 INFO L290 TraceCheckUtils]: 65: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,793 INFO L290 TraceCheckUtils]: 66: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,794 INFO L290 TraceCheckUtils]: 67: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,794 INFO L290 TraceCheckUtils]: 68: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,794 INFO L290 TraceCheckUtils]: 69: Hoare triple {59922#(= 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); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,794 INFO L290 TraceCheckUtils]: 70: Hoare triple {59922#(= 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; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,794 INFO L290 TraceCheckUtils]: 71: Hoare triple {59922#(= 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); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,795 INFO L290 TraceCheckUtils]: 72: Hoare triple {59922#(= 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); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,795 INFO L290 TraceCheckUtils]: 73: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,801 INFO L290 TraceCheckUtils]: 74: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,802 INFO L290 TraceCheckUtils]: 75: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,802 INFO L290 TraceCheckUtils]: 76: Hoare triple {59922#(= 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); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,802 INFO L290 TraceCheckUtils]: 77: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,803 INFO L290 TraceCheckUtils]: 78: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,803 INFO L290 TraceCheckUtils]: 79: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,803 INFO L290 TraceCheckUtils]: 80: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,803 INFO L290 TraceCheckUtils]: 81: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,803 INFO L290 TraceCheckUtils]: 82: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,804 INFO L290 TraceCheckUtils]: 83: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,804 INFO L290 TraceCheckUtils]: 84: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,804 INFO L290 TraceCheckUtils]: 85: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,804 INFO L290 TraceCheckUtils]: 86: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,804 INFO L290 TraceCheckUtils]: 87: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,805 INFO L290 TraceCheckUtils]: 88: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,805 INFO L290 TraceCheckUtils]: 89: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,805 INFO L290 TraceCheckUtils]: 90: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,805 INFO L290 TraceCheckUtils]: 91: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,806 INFO L290 TraceCheckUtils]: 92: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume 8528 == #t~mem62;havoc #t~mem62; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,806 INFO L290 TraceCheckUtils]: 93: Hoare triple {59922#(= 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); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,806 INFO L290 TraceCheckUtils]: 94: Hoare triple {59922#(= 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; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,806 INFO L290 TraceCheckUtils]: 95: Hoare triple {59922#(= 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); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,806 INFO L290 TraceCheckUtils]: 96: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,807 INFO L290 TraceCheckUtils]: 97: Hoare triple {59922#(= 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); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,807 INFO L290 TraceCheckUtils]: 98: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,807 INFO L290 TraceCheckUtils]: 99: Hoare triple {59922#(= 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); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,807 INFO L290 TraceCheckUtils]: 100: Hoare triple {59922#(= 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); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,808 INFO L290 TraceCheckUtils]: 101: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,808 INFO L290 TraceCheckUtils]: 102: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,808 INFO L290 TraceCheckUtils]: 103: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,808 INFO L290 TraceCheckUtils]: 104: Hoare triple {59922#(= 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); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,808 INFO L290 TraceCheckUtils]: 105: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,809 INFO L290 TraceCheckUtils]: 106: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,809 INFO L290 TraceCheckUtils]: 107: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,809 INFO L290 TraceCheckUtils]: 108: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,809 INFO L290 TraceCheckUtils]: 109: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,809 INFO L290 TraceCheckUtils]: 110: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,810 INFO L290 TraceCheckUtils]: 111: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,810 INFO L290 TraceCheckUtils]: 112: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,810 INFO L290 TraceCheckUtils]: 113: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,810 INFO L290 TraceCheckUtils]: 114: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,811 INFO L290 TraceCheckUtils]: 115: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,811 INFO L290 TraceCheckUtils]: 116: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,811 INFO L290 TraceCheckUtils]: 117: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,811 INFO L290 TraceCheckUtils]: 118: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,811 INFO L290 TraceCheckUtils]: 119: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,812 INFO L290 TraceCheckUtils]: 120: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,812 INFO L290 TraceCheckUtils]: 121: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,812 INFO L290 TraceCheckUtils]: 122: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume 8544 == #t~mem64;havoc #t~mem64; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,812 INFO L290 TraceCheckUtils]: 123: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,812 INFO L290 TraceCheckUtils]: 124: Hoare triple {59922#(= 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); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,813 INFO L290 TraceCheckUtils]: 125: Hoare triple {59922#(= 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; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,813 INFO L290 TraceCheckUtils]: 126: Hoare triple {59922#(= 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); {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,813 INFO L290 TraceCheckUtils]: 127: Hoare triple {59922#(= 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; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,813 INFO L290 TraceCheckUtils]: 128: Hoare triple {59922#(= 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; {59922#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:40:46,814 INFO L290 TraceCheckUtils]: 129: Hoare triple {59922#(= 2 ssl3_accept_~blastFlag~0)} assume 8 == ~blastFlag~0; {59918#false} is VALID [2022-04-14 18:40:46,814 INFO L290 TraceCheckUtils]: 130: Hoare triple {59918#false} assume !false; {59918#false} is VALID [2022-04-14 18:40:46,814 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-14 18:40:46,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:40:46,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516281492] [2022-04-14 18:40:46,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516281492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:40:46,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:40:46,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:40:46,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405447844] [2022-04-14 18:40:46,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:40:46,815 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-14 18:40:46,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:40:46,815 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-14 18:40:46,874 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-14 18:40:46,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:40:46,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:40:46,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:40:46,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:40:46,875 INFO L87 Difference]: Start difference. First operand 465 states and 693 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-14 18:40:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:51,270 INFO L93 Difference]: Finished difference Result 1295 states and 1949 transitions. [2022-04-14 18:40:51,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 18:40:51,270 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-14 18:40:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:40:51,271 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-14 18:40:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-14 18:40:51,275 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-14 18:40:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-14 18:40:51,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 603 transitions. [2022-04-14 18:40:51,632 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-14 18:40:51,655 INFO L225 Difference]: With dead ends: 1295 [2022-04-14 18:40:51,655 INFO L226 Difference]: Without dead ends: 856 [2022-04-14 18:40:51,656 INFO L912 BasicCegarLoop]: 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-14 18:40:51,656 INFO L913 BasicCegarLoop]: 246 mSDtfsCounter, 136 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:40:51,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 440 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-14 18:40:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-04-14 18:40:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2022-04-14 18:40:51,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:40:51,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 856 states. Second operand has 856 states, 851 states have (on average 1.4947121034077555) internal successors, (1272), 851 states have internal predecessors, (1272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:51,667 INFO L74 IsIncluded]: Start isIncluded. First operand 856 states. Second operand has 856 states, 851 states have (on average 1.4947121034077555) internal successors, (1272), 851 states have internal predecessors, (1272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:51,667 INFO L87 Difference]: Start difference. First operand 856 states. Second operand has 856 states, 851 states have (on average 1.4947121034077555) internal successors, (1272), 851 states have internal predecessors, (1272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:51,687 INFO L93 Difference]: Finished difference Result 856 states and 1276 transitions. [2022-04-14 18:40:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1276 transitions. [2022-04-14 18:40:51,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:51,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:51,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 856 states, 851 states have (on average 1.4947121034077555) internal successors, (1272), 851 states have internal predecessors, (1272), 3 states have call successors, (3), 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 856 states. [2022-04-14 18:40:51,689 INFO L87 Difference]: Start difference. First operand has 856 states, 851 states have (on average 1.4947121034077555) internal successors, (1272), 851 states have internal predecessors, (1272), 3 states have call successors, (3), 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 856 states. [2022-04-14 18:40:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:51,709 INFO L93 Difference]: Finished difference Result 856 states and 1276 transitions. [2022-04-14 18:40:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1276 transitions. [2022-04-14 18:40:51,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:51,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:51,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:40:51,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:40:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 851 states have (on average 1.4947121034077555) internal successors, (1272), 851 states have internal predecessors, (1272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:51,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1276 transitions. [2022-04-14 18:40:51,732 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1276 transitions. Word has length 131 [2022-04-14 18:40:51,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:40:51,732 INFO L478 AbstractCegarLoop]: Abstraction has 856 states and 1276 transitions. [2022-04-14 18:40:51,732 INFO L479 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-14 18:40:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1276 transitions. [2022-04-14 18:40:51,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-14 18:40:51,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:40:51,733 INFO L499 BasicCegarLoop]: 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-14 18:40:51,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-14 18:40:51,733 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:40:51,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:40:51,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1975617024, now seen corresponding path program 1 times [2022-04-14 18:40:51,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:40:51,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680894843] [2022-04-14 18:40:51,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:40:51,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:40:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:51,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:40:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:51,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {64018#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {64012#true} is VALID [2022-04-14 18:40:51,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {64012#true} assume true; {64012#true} is VALID [2022-04-14 18:40:51,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64012#true} {64012#true} #690#return; {64012#true} is VALID [2022-04-14 18:40:51,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {64012#true} call ULTIMATE.init(); {64018#(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-14 18:40:51,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {64018#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {64012#true} is VALID [2022-04-14 18:40:51,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {64012#true} assume true; {64012#true} is VALID [2022-04-14 18:40:51,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64012#true} {64012#true} #690#return; {64012#true} is VALID [2022-04-14 18:40:51,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {64012#true} call #t~ret161 := main(); {64012#true} is VALID [2022-04-14 18:40:51,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {64012#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; {64012#true} is VALID [2022-04-14 18:40:51,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {64012#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {64012#true} is VALID [2022-04-14 18:40:51,826 INFO L272 TraceCheckUtils]: 7: Hoare triple {64012#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {64012#true} is VALID [2022-04-14 18:40:51,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {64012#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); {64012#true} is VALID [2022-04-14 18:40:51,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {64012#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; {64012#true} is VALID [2022-04-14 18:40:51,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {64012#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; {64012#true} is VALID [2022-04-14 18:40:51,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {64012#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {64012#true} is VALID [2022-04-14 18:40:51,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {64012#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {64012#true} is VALID [2022-04-14 18:40:51,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {64012#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {64012#true} is VALID [2022-04-14 18:40:51,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {64012#true} assume !false; {64012#true} is VALID [2022-04-14 18:40:51,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {64012#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); {64012#true} is VALID [2022-04-14 18:40:51,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {64012#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64012#true} is VALID [2022-04-14 18:40:51,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {64012#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64012#true} is VALID [2022-04-14 18:40:51,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {64012#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64012#true} is VALID [2022-04-14 18:40:51,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {64012#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64012#true} is VALID [2022-04-14 18:40:51,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {64012#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64012#true} is VALID [2022-04-14 18:40:51,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {64012#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64012#true} is VALID [2022-04-14 18:40:51,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {64012#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64012#true} is VALID [2022-04-14 18:40:51,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {64012#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64012#true} is VALID [2022-04-14 18:40:51,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {64012#true} assume 8464 == #t~mem55;havoc #t~mem55; {64012#true} is VALID [2022-04-14 18:40:51,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {64012#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; {64012#true} is VALID [2022-04-14 18:40:51,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {64012#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {64017#(= 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); {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {64017#(= 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); {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume !false; {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {64017#(= 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); {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,830 INFO L290 TraceCheckUtils]: 40: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,830 INFO L290 TraceCheckUtils]: 41: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,830 INFO L290 TraceCheckUtils]: 42: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,831 INFO L290 TraceCheckUtils]: 43: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,831 INFO L290 TraceCheckUtils]: 44: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,831 INFO L290 TraceCheckUtils]: 45: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {64017#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:40:51,831 INFO L290 TraceCheckUtils]: 46: Hoare triple {64017#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {64013#false} is VALID [2022-04-14 18:40:51,831 INFO L290 TraceCheckUtils]: 47: Hoare triple {64013#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {64013#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {64013#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,831 INFO L290 TraceCheckUtils]: 50: Hoare triple {64013#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); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 51: Hoare triple {64013#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {64013#false} ~skip~0 := 0; {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 53: Hoare triple {64013#false} assume !false; {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 54: Hoare triple {64013#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); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 55: Hoare triple {64013#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 56: Hoare triple {64013#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 57: Hoare triple {64013#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 58: Hoare triple {64013#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 59: Hoare triple {64013#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 60: Hoare triple {64013#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 61: Hoare triple {64013#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 62: Hoare triple {64013#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 63: Hoare triple {64013#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 64: Hoare triple {64013#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 65: Hoare triple {64013#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 66: Hoare triple {64013#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 67: Hoare triple {64013#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 68: Hoare triple {64013#false} assume 8512 == #t~mem60;havoc #t~mem60; {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 69: Hoare triple {64013#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); {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 70: Hoare triple {64013#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; {64013#false} is VALID [2022-04-14 18:40:51,832 INFO L290 TraceCheckUtils]: 71: Hoare triple {64013#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 72: Hoare triple {64013#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); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 73: Hoare triple {64013#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 74: Hoare triple {64013#false} ~skip~0 := 0; {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 75: Hoare triple {64013#false} assume !false; {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 76: Hoare triple {64013#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); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 77: Hoare triple {64013#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 78: Hoare triple {64013#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 79: Hoare triple {64013#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 80: Hoare triple {64013#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 81: Hoare triple {64013#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 82: Hoare triple {64013#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 83: Hoare triple {64013#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 84: Hoare triple {64013#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 85: Hoare triple {64013#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 86: Hoare triple {64013#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 87: Hoare triple {64013#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 88: Hoare triple {64013#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,833 INFO L290 TraceCheckUtils]: 89: Hoare triple {64013#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,843 INFO L290 TraceCheckUtils]: 90: Hoare triple {64013#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,843 INFO L290 TraceCheckUtils]: 91: Hoare triple {64013#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,843 INFO L290 TraceCheckUtils]: 92: Hoare triple {64013#false} assume 8528 == #t~mem62;havoc #t~mem62; {64013#false} is VALID [2022-04-14 18:40:51,843 INFO L290 TraceCheckUtils]: 93: Hoare triple {64013#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); {64013#false} is VALID [2022-04-14 18:40:51,843 INFO L290 TraceCheckUtils]: 94: Hoare triple {64013#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; {64013#false} is VALID [2022-04-14 18:40:51,843 INFO L290 TraceCheckUtils]: 95: Hoare triple {64013#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); {64013#false} is VALID [2022-04-14 18:40:51,843 INFO L290 TraceCheckUtils]: 96: Hoare triple {64013#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {64013#false} is VALID [2022-04-14 18:40:51,843 INFO L290 TraceCheckUtils]: 97: Hoare triple {64013#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {64013#false} is VALID [2022-04-14 18:40:51,843 INFO L290 TraceCheckUtils]: 98: Hoare triple {64013#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {64013#false} is VALID [2022-04-14 18:40:51,843 INFO L290 TraceCheckUtils]: 99: Hoare triple {64013#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,843 INFO L290 TraceCheckUtils]: 100: Hoare triple {64013#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); {64013#false} is VALID [2022-04-14 18:40:51,843 INFO L290 TraceCheckUtils]: 101: Hoare triple {64013#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {64013#false} is VALID [2022-04-14 18:40:51,843 INFO L290 TraceCheckUtils]: 102: Hoare triple {64013#false} ~skip~0 := 0; {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 103: Hoare triple {64013#false} assume !false; {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 104: Hoare triple {64013#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); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 105: Hoare triple {64013#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 106: Hoare triple {64013#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 107: Hoare triple {64013#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 108: Hoare triple {64013#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 109: Hoare triple {64013#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 110: Hoare triple {64013#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 111: Hoare triple {64013#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 112: Hoare triple {64013#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 113: Hoare triple {64013#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 114: Hoare triple {64013#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 115: Hoare triple {64013#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 116: Hoare triple {64013#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 117: Hoare triple {64013#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 118: Hoare triple {64013#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 119: Hoare triple {64013#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 120: Hoare triple {64013#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 121: Hoare triple {64013#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 122: Hoare triple {64013#false} assume 8544 == #t~mem64;havoc #t~mem64; {64013#false} is VALID [2022-04-14 18:40:51,844 INFO L290 TraceCheckUtils]: 123: Hoare triple {64013#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {64013#false} is VALID [2022-04-14 18:40:51,845 INFO L290 TraceCheckUtils]: 124: Hoare triple {64013#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); {64013#false} is VALID [2022-04-14 18:40:51,845 INFO L290 TraceCheckUtils]: 125: Hoare triple {64013#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {64013#false} is VALID [2022-04-14 18:40:51,845 INFO L290 TraceCheckUtils]: 126: Hoare triple {64013#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); {64013#false} is VALID [2022-04-14 18:40:51,845 INFO L290 TraceCheckUtils]: 127: Hoare triple {64013#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; {64013#false} is VALID [2022-04-14 18:40:51,845 INFO L290 TraceCheckUtils]: 128: Hoare triple {64013#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; {64013#false} is VALID [2022-04-14 18:40:51,845 INFO L290 TraceCheckUtils]: 129: Hoare triple {64013#false} assume 8 == ~blastFlag~0; {64013#false} is VALID [2022-04-14 18:40:51,845 INFO L290 TraceCheckUtils]: 130: Hoare triple {64013#false} assume !false; {64013#false} is VALID [2022-04-14 18:40:51,845 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-14 18:40:51,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:40:51,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680894843] [2022-04-14 18:40:51,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680894843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:40:51,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:40:51,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:40:51,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021826262] [2022-04-14 18:40:51,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:40:51,846 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-14 18:40:51,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:40:51,847 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-14 18:40:51,910 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-14 18:40:51,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:40:51,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:40:51,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:40:51,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:40:51,911 INFO L87 Difference]: Start difference. First operand 856 states and 1276 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-14 18:40:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:57,396 INFO L93 Difference]: Finished difference Result 1713 states and 2559 transitions. [2022-04-14 18:40:57,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 18:40:57,397 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-14 18:40:57,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:40:57,397 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-14 18:40:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-14 18:40:57,398 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-14 18:40:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-14 18:40:57,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 448 transitions. [2022-04-14 18:40:57,652 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-14 18:40:57,677 INFO L225 Difference]: With dead ends: 1713 [2022-04-14 18:40:57,677 INFO L226 Difference]: Without dead ends: 883 [2022-04-14 18:40:57,678 INFO L912 BasicCegarLoop]: 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-14 18:40:57,678 INFO L913 BasicCegarLoop]: 223 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-14 18:40:57,679 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 417 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-14 18:40:57,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-04-14 18:40:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2022-04-14 18:40:57,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:40:57,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 883 states. Second operand has 883 states, 878 states have (on average 1.4886104783599088) internal successors, (1307), 878 states have internal predecessors, (1307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:57,689 INFO L74 IsIncluded]: Start isIncluded. First operand 883 states. Second operand has 883 states, 878 states have (on average 1.4886104783599088) internal successors, (1307), 878 states have internal predecessors, (1307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:57,689 INFO L87 Difference]: Start difference. First operand 883 states. Second operand has 883 states, 878 states have (on average 1.4886104783599088) internal successors, (1307), 878 states have internal predecessors, (1307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:57,711 INFO L93 Difference]: Finished difference Result 883 states and 1311 transitions. [2022-04-14 18:40:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2022-04-14 18:40:57,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:57,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:57,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 883 states, 878 states have (on average 1.4886104783599088) internal successors, (1307), 878 states have internal predecessors, (1307), 3 states have call successors, (3), 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 883 states. [2022-04-14 18:40:57,713 INFO L87 Difference]: Start difference. First operand has 883 states, 878 states have (on average 1.4886104783599088) internal successors, (1307), 878 states have internal predecessors, (1307), 3 states have call successors, (3), 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 883 states. [2022-04-14 18:40:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:40:57,733 INFO L93 Difference]: Finished difference Result 883 states and 1311 transitions. [2022-04-14 18:40:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2022-04-14 18:40:57,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:40:57,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:40:57,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:40:57,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:40:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 878 states have (on average 1.4886104783599088) internal successors, (1307), 878 states have internal predecessors, (1307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:40:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2022-04-14 18:40:57,757 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 131 [2022-04-14 18:40:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:40:57,757 INFO L478 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2022-04-14 18:40:57,771 INFO L479 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-14 18:40:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2022-04-14 18:40:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-14 18:40:57,772 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:40:57,772 INFO L499 BasicCegarLoop]: 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-14 18:40:57,772 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-14 18:40:57,772 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:40:57,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:40:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1857175550, now seen corresponding path program 1 times [2022-04-14 18:40:57,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:40:57,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782985511] [2022-04-14 18:40:57,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:40:57,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:40:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:57,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:40:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:40:57,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {68660#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {68654#true} is VALID [2022-04-14 18:40:57,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {68654#true} assume true; {68654#true} is VALID [2022-04-14 18:40:57,855 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68654#true} {68654#true} #690#return; {68654#true} is VALID [2022-04-14 18:40:57,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {68654#true} call ULTIMATE.init(); {68660#(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-14 18:40:57,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {68660#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {68654#true} is VALID [2022-04-14 18:40:57,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {68654#true} assume true; {68654#true} is VALID [2022-04-14 18:40:57,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68654#true} {68654#true} #690#return; {68654#true} is VALID [2022-04-14 18:40:57,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {68654#true} call #t~ret161 := main(); {68654#true} is VALID [2022-04-14 18:40:57,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {68654#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; {68654#true} is VALID [2022-04-14 18:40:57,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {68654#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {68654#true} is VALID [2022-04-14 18:40:57,856 INFO L272 TraceCheckUtils]: 7: Hoare triple {68654#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {68654#true} is VALID [2022-04-14 18:40:57,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {68654#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); {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {68659#(= 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; {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {68659#(= 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; {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {68659#(= 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)))); {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {68659#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {68659#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {68659#(= ssl3_accept_~blastFlag~0 0)} assume !false; {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {68659#(= 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); {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {68659#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {68659#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {68659#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {68659#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {68659#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {68659#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {68659#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {68659#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {68659#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {68659#(= 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; {68659#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {68659#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {68655#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); {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {68655#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); {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {68655#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {68655#false} ~skip~0 := 0; {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {68655#false} assume !false; {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {68655#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); {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {68655#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {68655#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {68655#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {68655#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {68655#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {68655#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {68655#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {68655#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {68655#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 42: Hoare triple {68655#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,860 INFO L290 TraceCheckUtils]: 43: Hoare triple {68655#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {68655#false} assume 8496 == #t~mem58;havoc #t~mem58; {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 45: Hoare triple {68655#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {68655#false} assume !(1 == ~blastFlag~0); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 47: Hoare triple {68655#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 48: Hoare triple {68655#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {68655#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {68655#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); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {68655#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {68655#false} ~skip~0 := 0; {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {68655#false} assume !false; {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {68655#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); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 55: Hoare triple {68655#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 56: Hoare triple {68655#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 57: Hoare triple {68655#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 58: Hoare triple {68655#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 59: Hoare triple {68655#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 60: Hoare triple {68655#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 61: Hoare triple {68655#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 62: Hoare triple {68655#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 63: Hoare triple {68655#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,861 INFO L290 TraceCheckUtils]: 64: Hoare triple {68655#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {68655#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 66: Hoare triple {68655#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 67: Hoare triple {68655#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 68: Hoare triple {68655#false} assume 8512 == #t~mem60;havoc #t~mem60; {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 69: Hoare triple {68655#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); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 70: Hoare triple {68655#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; {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 71: Hoare triple {68655#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 72: Hoare triple {68655#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); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 73: Hoare triple {68655#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 74: Hoare triple {68655#false} ~skip~0 := 0; {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 75: Hoare triple {68655#false} assume !false; {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 76: Hoare triple {68655#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); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 77: Hoare triple {68655#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 78: Hoare triple {68655#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 79: Hoare triple {68655#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 80: Hoare triple {68655#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 81: Hoare triple {68655#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 82: Hoare triple {68655#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 83: Hoare triple {68655#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 84: Hoare triple {68655#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 85: Hoare triple {68655#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,862 INFO L290 TraceCheckUtils]: 86: Hoare triple {68655#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 87: Hoare triple {68655#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 88: Hoare triple {68655#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 89: Hoare triple {68655#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 90: Hoare triple {68655#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 91: Hoare triple {68655#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 92: Hoare triple {68655#false} assume 8528 == #t~mem62;havoc #t~mem62; {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 93: Hoare triple {68655#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); {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 94: Hoare triple {68655#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; {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 95: Hoare triple {68655#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); {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 96: Hoare triple {68655#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 97: Hoare triple {68655#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 98: Hoare triple {68655#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 99: Hoare triple {68655#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 100: Hoare triple {68655#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); {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 101: Hoare triple {68655#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 102: Hoare triple {68655#false} ~skip~0 := 0; {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 103: Hoare triple {68655#false} assume !false; {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 104: Hoare triple {68655#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); {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 105: Hoare triple {68655#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 106: Hoare triple {68655#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,863 INFO L290 TraceCheckUtils]: 107: Hoare triple {68655#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 108: Hoare triple {68655#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 109: Hoare triple {68655#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 110: Hoare triple {68655#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 111: Hoare triple {68655#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 112: Hoare triple {68655#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 113: Hoare triple {68655#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 114: Hoare triple {68655#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 115: Hoare triple {68655#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 116: Hoare triple {68655#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 117: Hoare triple {68655#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 118: Hoare triple {68655#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 119: Hoare triple {68655#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 120: Hoare triple {68655#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 121: Hoare triple {68655#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 122: Hoare triple {68655#false} assume 8544 == #t~mem64;havoc #t~mem64; {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 123: Hoare triple {68655#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 124: Hoare triple {68655#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); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 125: Hoare triple {68655#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 126: Hoare triple {68655#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); {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 127: Hoare triple {68655#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; {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 128: Hoare triple {68655#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; {68655#false} is VALID [2022-04-14 18:40:57,864 INFO L290 TraceCheckUtils]: 129: Hoare triple {68655#false} assume 8 == ~blastFlag~0; {68655#false} is VALID [2022-04-14 18:40:57,865 INFO L290 TraceCheckUtils]: 130: Hoare triple {68655#false} assume !false; {68655#false} is VALID [2022-04-14 18:40:57,865 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-14 18:40:57,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:40:57,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782985511] [2022-04-14 18:40:57,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782985511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:40:57,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:40:57,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:40:57,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314395831] [2022-04-14 18:40:57,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:40:57,866 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-14 18:40:57,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:40:57,866 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-14 18:40:57,917 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-14 18:40:57,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:40:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:40:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:40:57,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:40:57,918 INFO L87 Difference]: Start difference. First operand 883 states and 1311 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-14 18:41:00,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:41:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:02,011 INFO L93 Difference]: Finished difference Result 1742 states and 2595 transitions. [2022-04-14 18:41:02,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 18:41:02,011 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-14 18:41:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:41:02,012 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-14 18:41:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-14 18:41:02,014 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-14 18:41:02,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-14 18:41:02,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 425 transitions. [2022-04-14 18:41:02,296 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-14 18:41:02,321 INFO L225 Difference]: With dead ends: 1742 [2022-04-14 18:41:02,321 INFO L226 Difference]: Without dead ends: 885 [2022-04-14 18:41:02,322 INFO L912 BasicCegarLoop]: 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-14 18:41:02,322 INFO L913 BasicCegarLoop]: 211 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 2.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:41:02,322 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 396 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-14 18:41:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-04-14 18:41:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2022-04-14 18:41:02,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:41:02,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 885 states. Second operand has 885 states, 880 states have (on average 1.4875) internal successors, (1309), 880 states have internal predecessors, (1309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:02,333 INFO L74 IsIncluded]: Start isIncluded. First operand 885 states. Second operand has 885 states, 880 states have (on average 1.4875) internal successors, (1309), 880 states have internal predecessors, (1309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:02,333 INFO L87 Difference]: Start difference. First operand 885 states. Second operand has 885 states, 880 states have (on average 1.4875) internal successors, (1309), 880 states have internal predecessors, (1309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:02,354 INFO L93 Difference]: Finished difference Result 885 states and 1313 transitions. [2022-04-14 18:41:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1313 transitions. [2022-04-14 18:41:02,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:41:02,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:41:02,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 885 states, 880 states have (on average 1.4875) internal successors, (1309), 880 states have internal predecessors, (1309), 3 states have call successors, (3), 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 885 states. [2022-04-14 18:41:02,356 INFO L87 Difference]: Start difference. First operand has 885 states, 880 states have (on average 1.4875) internal successors, (1309), 880 states have internal predecessors, (1309), 3 states have call successors, (3), 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 885 states. [2022-04-14 18:41:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:02,377 INFO L93 Difference]: Finished difference Result 885 states and 1313 transitions. [2022-04-14 18:41:02,377 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1313 transitions. [2022-04-14 18:41:02,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:41:02,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:41:02,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:41:02,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:41:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 880 states have (on average 1.4875) internal successors, (1309), 880 states have internal predecessors, (1309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:02,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1313 transitions. [2022-04-14 18:41:02,401 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1313 transitions. Word has length 131 [2022-04-14 18:41:02,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:41:02,401 INFO L478 AbstractCegarLoop]: Abstraction has 885 states and 1313 transitions. [2022-04-14 18:41:02,402 INFO L479 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-14 18:41:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1313 transitions. [2022-04-14 18:41:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-14 18:41:02,402 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:41:02,403 INFO L499 BasicCegarLoop]: 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-14 18:41:02,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-14 18:41:02,403 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:41:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:41:02,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1541930600, now seen corresponding path program 1 times [2022-04-14 18:41:02,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:41:02,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770536473] [2022-04-14 18:41:02,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:41:02,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:41:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:02,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:41:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:02,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {73343#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {73337#true} is VALID [2022-04-14 18:41:02,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {73337#true} assume true; {73337#true} is VALID [2022-04-14 18:41:02,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73337#true} {73337#true} #690#return; {73337#true} is VALID [2022-04-14 18:41:02,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {73337#true} call ULTIMATE.init(); {73343#(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-14 18:41:02,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {73343#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {73337#true} is VALID [2022-04-14 18:41:02,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {73337#true} assume true; {73337#true} is VALID [2022-04-14 18:41:02,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73337#true} {73337#true} #690#return; {73337#true} is VALID [2022-04-14 18:41:02,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {73337#true} call #t~ret161 := main(); {73337#true} is VALID [2022-04-14 18:41:02,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {73337#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; {73337#true} is VALID [2022-04-14 18:41:02,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {73337#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,515 INFO L272 TraceCheckUtils]: 7: Hoare triple {73337#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {73337#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); {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {73337#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; {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {73337#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; {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {73337#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {73337#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {73337#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {73337#true} assume !false; {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {73337#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); {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {73337#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {73337#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {73337#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {73337#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {73337#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {73337#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {73337#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {73337#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {73337#true} assume 8464 == #t~mem55;havoc #t~mem55; {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {73337#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; {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {73337#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {73337#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); {73337#true} is VALID [2022-04-14 18:41:02,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {73337#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); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {73337#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {73337#true} ~skip~0 := 0; {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {73337#true} assume !false; {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {73337#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); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {73337#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {73337#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {73337#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 36: Hoare triple {73337#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {73337#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 38: Hoare triple {73337#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 39: Hoare triple {73337#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {73337#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {73337#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {73337#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {73337#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {73337#true} assume 8496 == #t~mem58;havoc #t~mem58; {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {73337#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {73337#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {73337#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {73337#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {73337#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 50: Hoare triple {73337#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); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 51: Hoare triple {73337#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 52: Hoare triple {73337#true} ~skip~0 := 0; {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 53: Hoare triple {73337#true} assume !false; {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 54: Hoare triple {73337#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); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 55: Hoare triple {73337#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 56: Hoare triple {73337#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 57: Hoare triple {73337#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 58: Hoare triple {73337#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 59: Hoare triple {73337#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 60: Hoare triple {73337#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 61: Hoare triple {73337#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 62: Hoare triple {73337#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 63: Hoare triple {73337#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 64: Hoare triple {73337#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 65: Hoare triple {73337#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 66: Hoare triple {73337#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 67: Hoare triple {73337#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 68: Hoare triple {73337#true} assume 8512 == #t~mem60;havoc #t~mem60; {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 69: Hoare triple {73337#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); {73337#true} is VALID [2022-04-14 18:41:02,518 INFO L290 TraceCheckUtils]: 70: Hoare triple {73337#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; {73337#true} is VALID [2022-04-14 18:41:02,519 INFO L290 TraceCheckUtils]: 71: Hoare triple {73337#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,519 INFO L290 TraceCheckUtils]: 72: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(~ret~0 <= 0); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,519 INFO L290 TraceCheckUtils]: 73: Hoare triple {73342#(<= 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); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,519 INFO L290 TraceCheckUtils]: 74: Hoare triple {73342#(<= 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); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,520 INFO L290 TraceCheckUtils]: 75: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,520 INFO L290 TraceCheckUtils]: 76: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,520 INFO L290 TraceCheckUtils]: 77: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,520 INFO L290 TraceCheckUtils]: 78: Hoare triple {73342#(<= 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); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,521 INFO L290 TraceCheckUtils]: 79: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,521 INFO L290 TraceCheckUtils]: 80: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,521 INFO L290 TraceCheckUtils]: 81: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,521 INFO L290 TraceCheckUtils]: 82: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,521 INFO L290 TraceCheckUtils]: 83: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,522 INFO L290 TraceCheckUtils]: 84: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,522 INFO L290 TraceCheckUtils]: 85: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,522 INFO L290 TraceCheckUtils]: 86: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,522 INFO L290 TraceCheckUtils]: 87: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,523 INFO L290 TraceCheckUtils]: 88: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,523 INFO L290 TraceCheckUtils]: 89: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,523 INFO L290 TraceCheckUtils]: 90: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,523 INFO L290 TraceCheckUtils]: 91: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,523 INFO L290 TraceCheckUtils]: 92: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,524 INFO L290 TraceCheckUtils]: 93: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,524 INFO L290 TraceCheckUtils]: 94: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume 8528 == #t~mem62;havoc #t~mem62; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,524 INFO L290 TraceCheckUtils]: 95: Hoare triple {73342#(<= 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); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,524 INFO L290 TraceCheckUtils]: 96: Hoare triple {73342#(<= 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; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,525 INFO L290 TraceCheckUtils]: 97: Hoare triple {73342#(<= 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); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,525 INFO L290 TraceCheckUtils]: 98: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,525 INFO L290 TraceCheckUtils]: 99: Hoare triple {73342#(<= 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); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,525 INFO L290 TraceCheckUtils]: 100: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,525 INFO L290 TraceCheckUtils]: 101: Hoare triple {73342#(<= 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); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,526 INFO L290 TraceCheckUtils]: 102: Hoare triple {73342#(<= 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); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,526 INFO L290 TraceCheckUtils]: 103: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,526 INFO L290 TraceCheckUtils]: 104: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,526 INFO L290 TraceCheckUtils]: 105: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,527 INFO L290 TraceCheckUtils]: 106: Hoare triple {73342#(<= 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); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,527 INFO L290 TraceCheckUtils]: 107: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,527 INFO L290 TraceCheckUtils]: 108: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,527 INFO L290 TraceCheckUtils]: 109: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,527 INFO L290 TraceCheckUtils]: 110: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,528 INFO L290 TraceCheckUtils]: 111: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,528 INFO L290 TraceCheckUtils]: 112: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,528 INFO L290 TraceCheckUtils]: 113: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,528 INFO L290 TraceCheckUtils]: 114: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,529 INFO L290 TraceCheckUtils]: 115: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,529 INFO L290 TraceCheckUtils]: 116: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,529 INFO L290 TraceCheckUtils]: 117: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,529 INFO L290 TraceCheckUtils]: 118: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,529 INFO L290 TraceCheckUtils]: 119: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,530 INFO L290 TraceCheckUtils]: 120: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,530 INFO L290 TraceCheckUtils]: 121: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,530 INFO L290 TraceCheckUtils]: 122: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,530 INFO L290 TraceCheckUtils]: 123: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,531 INFO L290 TraceCheckUtils]: 124: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume 8544 == #t~mem64;havoc #t~mem64; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,531 INFO L290 TraceCheckUtils]: 125: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,531 INFO L290 TraceCheckUtils]: 126: Hoare triple {73342#(<= 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); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,531 INFO L290 TraceCheckUtils]: 127: Hoare triple {73342#(<= 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; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,532 INFO L290 TraceCheckUtils]: 128: Hoare triple {73342#(<= 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); {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,532 INFO L290 TraceCheckUtils]: 129: Hoare triple {73342#(<= 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; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,532 INFO L290 TraceCheckUtils]: 130: Hoare triple {73342#(<= 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; {73342#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-14 18:41:02,532 INFO L290 TraceCheckUtils]: 131: Hoare triple {73342#(<= ssl3_accept_~blastFlag~0 6)} assume 8 == ~blastFlag~0; {73338#false} is VALID [2022-04-14 18:41:02,532 INFO L290 TraceCheckUtils]: 132: Hoare triple {73338#false} assume !false; {73338#false} is VALID [2022-04-14 18:41:02,533 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-14 18:41:02,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:41:02,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770536473] [2022-04-14 18:41:02,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770536473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:41:02,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:41:02,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:41:02,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273519901] [2022-04-14 18:41:02,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:41:02,534 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-14 18:41:02,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:41:02,534 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-14 18:41:02,595 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-14 18:41:02,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:41:02,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:41:02,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:41:02,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:41:02,596 INFO L87 Difference]: Start difference. First operand 885 states and 1313 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-14 18:41:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:06,662 INFO L93 Difference]: Finished difference Result 2181 states and 3257 transitions. [2022-04-14 18:41:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 18:41:06,663 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-14 18:41:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:41:06,663 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-14 18:41:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-14 18:41:06,665 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-14 18:41:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-14 18:41:06,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 607 transitions. [2022-04-14 18:41:07,011 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-14 18:41:07,059 INFO L225 Difference]: With dead ends: 2181 [2022-04-14 18:41:07,059 INFO L226 Difference]: Without dead ends: 1324 [2022-04-14 18:41:07,060 INFO L912 BasicCegarLoop]: 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-14 18:41:07,060 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 157 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-14 18:41:07,061 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 380 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-14 18:41:07,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2022-04-14 18:41:07,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1322. [2022-04-14 18:41:07,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:41:07,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1324 states. Second operand has 1322 states, 1317 states have (on average 1.4950645406226273) internal successors, (1969), 1317 states have internal predecessors, (1969), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:07,116 INFO L74 IsIncluded]: Start isIncluded. First operand 1324 states. Second operand has 1322 states, 1317 states have (on average 1.4950645406226273) internal successors, (1969), 1317 states have internal predecessors, (1969), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:07,116 INFO L87 Difference]: Start difference. First operand 1324 states. Second operand has 1322 states, 1317 states have (on average 1.4950645406226273) internal successors, (1969), 1317 states have internal predecessors, (1969), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:07,158 INFO L93 Difference]: Finished difference Result 1324 states and 1974 transitions. [2022-04-14 18:41:07,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1974 transitions. [2022-04-14 18:41:07,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:41:07,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:41:07,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 1322 states, 1317 states have (on average 1.4950645406226273) internal successors, (1969), 1317 states have internal predecessors, (1969), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1324 states. [2022-04-14 18:41:07,160 INFO L87 Difference]: Start difference. First operand has 1322 states, 1317 states have (on average 1.4950645406226273) internal successors, (1969), 1317 states have internal predecessors, (1969), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1324 states. [2022-04-14 18:41:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:07,201 INFO L93 Difference]: Finished difference Result 1324 states and 1974 transitions. [2022-04-14 18:41:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1974 transitions. [2022-04-14 18:41:07,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:41:07,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:41:07,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:41:07,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:41:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1317 states have (on average 1.4950645406226273) internal successors, (1969), 1317 states have internal predecessors, (1969), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1973 transitions. [2022-04-14 18:41:07,249 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1973 transitions. Word has length 133 [2022-04-14 18:41:07,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:41:07,249 INFO L478 AbstractCegarLoop]: Abstraction has 1322 states and 1973 transitions. [2022-04-14 18:41:07,249 INFO L479 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-14 18:41:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1973 transitions. [2022-04-14 18:41:07,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-14 18:41:07,250 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:41:07,250 INFO L499 BasicCegarLoop]: 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-14 18:41:07,250 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-14 18:41:07,250 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:41:07,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:41:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1653660413, now seen corresponding path program 1 times [2022-04-14 18:41:07,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:41:07,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174882183] [2022-04-14 18:41:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:41:07,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:41:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:07,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:41:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:07,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {79865#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {79859#true} is VALID [2022-04-14 18:41:07,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {79859#true} assume true; {79859#true} is VALID [2022-04-14 18:41:07,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79859#true} {79859#true} #690#return; {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {79859#true} call ULTIMATE.init(); {79865#(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-14 18:41:07,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {79865#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {79859#true} assume true; {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79859#true} {79859#true} #690#return; {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {79859#true} call #t~ret161 := main(); {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {79859#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; {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {79859#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L272 TraceCheckUtils]: 7: Hoare triple {79859#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {79859#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); {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {79859#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; {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {79859#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; {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {79859#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {79859#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {79859#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {79859#true} assume !false; {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {79859#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); {79859#true} is VALID [2022-04-14 18:41:07,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {79859#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {79859#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {79859#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {79859#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {79859#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {79859#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {79859#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {79859#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {79859#true} assume 8464 == #t~mem55;havoc #t~mem55; {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {79859#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; {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {79859#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {79859#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); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {79859#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); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {79859#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {79859#true} ~skip~0 := 0; {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {79859#true} assume !false; {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {79859#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); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {79859#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {79859#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {79859#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {79859#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {79859#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {79859#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {79859#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {79859#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {79859#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {79859#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {79859#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 44: Hoare triple {79859#true} assume 8496 == #t~mem58;havoc #t~mem58; {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 45: Hoare triple {79859#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 46: Hoare triple {79859#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 47: Hoare triple {79859#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 48: Hoare triple {79859#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 49: Hoare triple {79859#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 50: Hoare triple {79859#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); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 51: Hoare triple {79859#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 52: Hoare triple {79859#true} ~skip~0 := 0; {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 53: Hoare triple {79859#true} assume !false; {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 54: Hoare triple {79859#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); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 55: Hoare triple {79859#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 56: Hoare triple {79859#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 57: Hoare triple {79859#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,387 INFO L290 TraceCheckUtils]: 58: Hoare triple {79859#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 59: Hoare triple {79859#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 60: Hoare triple {79859#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {79859#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 62: Hoare triple {79859#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 63: Hoare triple {79859#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 64: Hoare triple {79859#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 65: Hoare triple {79859#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 66: Hoare triple {79859#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 67: Hoare triple {79859#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 68: Hoare triple {79859#true} assume 8512 == #t~mem60;havoc #t~mem60; {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 69: Hoare triple {79859#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); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 70: Hoare triple {79859#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; {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 71: Hoare triple {79859#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 72: Hoare triple {79859#true} assume !(~ret~0 <= 0); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 73: Hoare triple {79859#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 74: Hoare triple {79859#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); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 75: Hoare triple {79859#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 76: Hoare triple {79859#true} ~skip~0 := 0; {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 77: Hoare triple {79859#true} assume !false; {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 78: Hoare triple {79859#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); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 79: Hoare triple {79859#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,388 INFO L290 TraceCheckUtils]: 80: Hoare triple {79859#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 81: Hoare triple {79859#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 82: Hoare triple {79859#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 83: Hoare triple {79859#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 84: Hoare triple {79859#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 85: Hoare triple {79859#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 86: Hoare triple {79859#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 87: Hoare triple {79859#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 88: Hoare triple {79859#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 89: Hoare triple {79859#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 90: Hoare triple {79859#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 91: Hoare triple {79859#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 92: Hoare triple {79859#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 93: Hoare triple {79859#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 94: Hoare triple {79859#true} assume 8528 == #t~mem62;havoc #t~mem62; {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 95: Hoare triple {79859#true} 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); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 96: Hoare triple {79859#true} 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; {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 97: Hoare triple {79859#true} 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); {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 98: Hoare triple {79859#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {79859#true} is VALID [2022-04-14 18:41:07,389 INFO L290 TraceCheckUtils]: 99: Hoare triple {79859#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {79859#true} is VALID [2022-04-14 18:41:07,390 INFO L290 TraceCheckUtils]: 100: Hoare triple {79859#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,390 INFO L290 TraceCheckUtils]: 101: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(~ret~0 <= 0); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,390 INFO L290 TraceCheckUtils]: 102: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,390 INFO L290 TraceCheckUtils]: 103: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} 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); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,391 INFO L290 TraceCheckUtils]: 104: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,391 INFO L290 TraceCheckUtils]: 105: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} ~skip~0 := 0; {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,391 INFO L290 TraceCheckUtils]: 106: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !false; {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,391 INFO L290 TraceCheckUtils]: 107: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,391 INFO L290 TraceCheckUtils]: 108: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,392 INFO L290 TraceCheckUtils]: 109: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,392 INFO L290 TraceCheckUtils]: 110: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,392 INFO L290 TraceCheckUtils]: 111: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,392 INFO L290 TraceCheckUtils]: 112: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,393 INFO L290 TraceCheckUtils]: 113: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,393 INFO L290 TraceCheckUtils]: 114: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,393 INFO L290 TraceCheckUtils]: 115: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,393 INFO L290 TraceCheckUtils]: 116: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,393 INFO L290 TraceCheckUtils]: 117: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,394 INFO L290 TraceCheckUtils]: 118: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,394 INFO L290 TraceCheckUtils]: 119: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,394 INFO L290 TraceCheckUtils]: 120: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,394 INFO L290 TraceCheckUtils]: 121: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,395 INFO L290 TraceCheckUtils]: 122: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,395 INFO L290 TraceCheckUtils]: 123: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,395 INFO L290 TraceCheckUtils]: 124: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,395 INFO L290 TraceCheckUtils]: 125: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume 8544 == #t~mem64;havoc #t~mem64; {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,395 INFO L290 TraceCheckUtils]: 126: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,396 INFO L290 TraceCheckUtils]: 127: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} 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); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,396 INFO L290 TraceCheckUtils]: 128: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,396 INFO L290 TraceCheckUtils]: 129: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} 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); {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,396 INFO L290 TraceCheckUtils]: 130: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} 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; {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,397 INFO L290 TraceCheckUtils]: 131: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} 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; {79864#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-14 18:41:07,397 INFO L290 TraceCheckUtils]: 132: Hoare triple {79864#(<= ssl3_accept_~blastFlag~0 7)} assume 8 == ~blastFlag~0; {79860#false} is VALID [2022-04-14 18:41:07,397 INFO L290 TraceCheckUtils]: 133: Hoare triple {79860#false} assume !false; {79860#false} is VALID [2022-04-14 18:41:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-14 18:41:07,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:41:07,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174882183] [2022-04-14 18:41:07,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174882183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:41:07,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:41:07,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:41:07,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873309830] [2022-04-14 18:41:07,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:41:07,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-14 18:41:07,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:41:07,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:07,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:41:07,450 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:41:07,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:41:07,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:41:07,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:41:07,451 INFO L87 Difference]: Start difference. First operand 1322 states and 1973 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:11,883 INFO L93 Difference]: Finished difference Result 1763 states and 2637 transitions. [2022-04-14 18:41:11,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 18:41:11,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-14 18:41:11,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:41:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-14 18:41:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-14 18:41:11,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 412 transitions. [2022-04-14 18:41:12,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 412 edges. 412 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:41:12,222 INFO L225 Difference]: With dead ends: 1763 [2022-04-14 18:41:12,222 INFO L226 Difference]: Without dead ends: 1761 [2022-04-14 18:41:12,223 INFO L912 BasicCegarLoop]: 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-14 18:41:12,223 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 165 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-14 18:41:12,223 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 378 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-14 18:41:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2022-04-14 18:41:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1759. [2022-04-14 18:41:12,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:41:12,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1761 states. Second operand has 1759 states, 1754 states have (on average 1.499429874572406) internal successors, (2630), 1754 states have internal predecessors, (2630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:12,332 INFO L74 IsIncluded]: Start isIncluded. First operand 1761 states. Second operand has 1759 states, 1754 states have (on average 1.499429874572406) internal successors, (2630), 1754 states have internal predecessors, (2630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:12,333 INFO L87 Difference]: Start difference. First operand 1761 states. Second operand has 1759 states, 1754 states have (on average 1.499429874572406) internal successors, (2630), 1754 states have internal predecessors, (2630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:12,410 INFO L93 Difference]: Finished difference Result 1761 states and 2635 transitions. [2022-04-14 18:41:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2635 transitions. [2022-04-14 18:41:12,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:41:12,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:41:12,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 1759 states, 1754 states have (on average 1.499429874572406) internal successors, (2630), 1754 states have internal predecessors, (2630), 3 states have call successors, (3), 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 1761 states. [2022-04-14 18:41:12,414 INFO L87 Difference]: Start difference. First operand has 1759 states, 1754 states have (on average 1.499429874572406) internal successors, (2630), 1754 states have internal predecessors, (2630), 3 states have call successors, (3), 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 1761 states. [2022-04-14 18:41:12,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:12,492 INFO L93 Difference]: Finished difference Result 1761 states and 2635 transitions. [2022-04-14 18:41:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2635 transitions. [2022-04-14 18:41:12,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:41:12,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:41:12,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:41:12,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:41:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1754 states have (on average 1.499429874572406) internal successors, (2630), 1754 states have internal predecessors, (2630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2634 transitions. [2022-04-14 18:41:12,581 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2634 transitions. Word has length 134 [2022-04-14 18:41:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:41:12,581 INFO L478 AbstractCegarLoop]: Abstraction has 1759 states and 2634 transitions. [2022-04-14 18:41:12,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2634 transitions. [2022-04-14 18:41:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-14 18:41:12,582 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:41:12,582 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:41:12,582 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-14 18:41:12,582 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:41:12,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:41:12,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1084292733, now seen corresponding path program 1 times [2022-04-14 18:41:12,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:41:12,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086786518] [2022-04-14 18:41:12,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:41:12,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:41:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:12,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:41:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:12,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {87279#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {87272#true} is VALID [2022-04-14 18:41:12,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {87272#true} assume true; {87272#true} is VALID [2022-04-14 18:41:12,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87272#true} {87272#true} #690#return; {87272#true} is VALID [2022-04-14 18:41:12,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {87272#true} call ULTIMATE.init(); {87279#(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-14 18:41:12,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {87279#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {87272#true} is VALID [2022-04-14 18:41:12,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {87272#true} assume true; {87272#true} is VALID [2022-04-14 18:41:12,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87272#true} {87272#true} #690#return; {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {87272#true} call #t~ret161 := main(); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {87272#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; {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {87272#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L272 TraceCheckUtils]: 7: Hoare triple {87272#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {87272#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); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {87272#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; {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {87272#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; {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {87272#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {87272#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {87272#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {87272#true} assume !false; {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {87272#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); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {87272#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {87272#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {87272#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {87272#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {87272#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {87272#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {87272#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {87272#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {87272#true} assume 8464 == #t~mem55;havoc #t~mem55; {87272#true} is VALID [2022-04-14 18:41:12,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {87272#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; {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {87272#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {87272#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); {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {87272#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); {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {87272#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {87272#true} ~skip~0 := 0; {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {87272#true} assume !false; {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {87272#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); {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {87272#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {87272#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {87272#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {87272#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {87272#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {87272#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {87272#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {87272#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 41: Hoare triple {87272#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 42: Hoare triple {87272#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {87272#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {87272#true} assume 8496 == #t~mem58;havoc #t~mem58; {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {87272#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {87272#true} is VALID [2022-04-14 18:41:12,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {87272#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 47: Hoare triple {87272#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 48: Hoare triple {87272#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 49: Hoare triple {87272#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {87272#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); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 51: Hoare triple {87272#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 52: Hoare triple {87272#true} ~skip~0 := 0; {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 53: Hoare triple {87272#true} assume !false; {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 54: Hoare triple {87272#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); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 55: Hoare triple {87272#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 56: Hoare triple {87272#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 57: Hoare triple {87272#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {87272#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 59: Hoare triple {87272#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {87272#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 61: Hoare triple {87272#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 62: Hoare triple {87272#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 63: Hoare triple {87272#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 64: Hoare triple {87272#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 65: Hoare triple {87272#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 66: Hoare triple {87272#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,700 INFO L290 TraceCheckUtils]: 67: Hoare triple {87272#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {87272#true} is VALID [2022-04-14 18:41:12,701 INFO L290 TraceCheckUtils]: 68: Hoare triple {87272#true} assume 8512 == #t~mem60;havoc #t~mem60; {87272#true} is VALID [2022-04-14 18:41:12,701 INFO L290 TraceCheckUtils]: 69: Hoare triple {87272#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); {87272#true} is VALID [2022-04-14 18:41:12,701 INFO L290 TraceCheckUtils]: 70: Hoare triple {87272#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; {87272#true} is VALID [2022-04-14 18:41:12,701 INFO L290 TraceCheckUtils]: 71: Hoare triple {87272#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {87272#true} is VALID [2022-04-14 18:41:12,701 INFO L290 TraceCheckUtils]: 72: Hoare triple {87272#true} assume !(~ret~0 <= 0); {87272#true} is VALID [2022-04-14 18:41:12,702 INFO L290 TraceCheckUtils]: 73: Hoare triple {87272#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,702 INFO L290 TraceCheckUtils]: 74: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,702 INFO L290 TraceCheckUtils]: 75: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,702 INFO L290 TraceCheckUtils]: 76: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,703 INFO L290 TraceCheckUtils]: 77: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,703 INFO L290 TraceCheckUtils]: 78: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,703 INFO L290 TraceCheckUtils]: 79: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,704 INFO L290 TraceCheckUtils]: 80: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,704 INFO L290 TraceCheckUtils]: 81: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,704 INFO L290 TraceCheckUtils]: 82: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,704 INFO L290 TraceCheckUtils]: 83: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,705 INFO L290 TraceCheckUtils]: 84: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,705 INFO L290 TraceCheckUtils]: 85: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,705 INFO L290 TraceCheckUtils]: 86: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,706 INFO L290 TraceCheckUtils]: 87: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,706 INFO L290 TraceCheckUtils]: 88: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,706 INFO L290 TraceCheckUtils]: 89: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,707 INFO L290 TraceCheckUtils]: 90: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,707 INFO L290 TraceCheckUtils]: 91: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,707 INFO L290 TraceCheckUtils]: 92: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,707 INFO L290 TraceCheckUtils]: 93: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,708 INFO L290 TraceCheckUtils]: 94: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,708 INFO L290 TraceCheckUtils]: 95: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,708 INFO L290 TraceCheckUtils]: 96: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,709 INFO L290 TraceCheckUtils]: 97: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,709 INFO L290 TraceCheckUtils]: 98: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:12,709 INFO L290 TraceCheckUtils]: 99: Hoare triple {87277#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {87278#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-14 18:41:12,709 INFO L290 TraceCheckUtils]: 100: Hoare triple {87278#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {87273#false} is VALID [2022-04-14 18:41:12,709 INFO L290 TraceCheckUtils]: 101: Hoare triple {87273#false} assume !(~num1~0 > 0); {87273#false} is VALID [2022-04-14 18:41:12,709 INFO L290 TraceCheckUtils]: 102: Hoare triple {87273#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; {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 103: Hoare triple {87273#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); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 104: Hoare triple {87273#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 105: Hoare triple {87273#false} ~skip~0 := 0; {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 106: Hoare triple {87273#false} assume !false; {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 107: Hoare triple {87273#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); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 108: Hoare triple {87273#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 109: Hoare triple {87273#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 110: Hoare triple {87273#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 111: Hoare triple {87273#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 112: Hoare triple {87273#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 113: Hoare triple {87273#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 114: Hoare triple {87273#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 115: Hoare triple {87273#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 116: Hoare triple {87273#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 117: Hoare triple {87273#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 118: Hoare triple {87273#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 119: Hoare triple {87273#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 120: Hoare triple {87273#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 121: Hoare triple {87273#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 122: Hoare triple {87273#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 123: Hoare triple {87273#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,710 INFO L290 TraceCheckUtils]: 124: Hoare triple {87273#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 125: Hoare triple {87273#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 126: Hoare triple {87273#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 127: Hoare triple {87273#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 128: Hoare triple {87273#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 129: Hoare triple {87273#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 130: Hoare triple {87273#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 131: Hoare triple {87273#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 132: Hoare triple {87273#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 133: Hoare triple {87273#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 134: Hoare triple {87273#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 135: Hoare triple {87273#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 136: Hoare triple {87273#false} assume 8640 == #t~mem75;havoc #t~mem75; {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 137: Hoare triple {87273#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 138: Hoare triple {87273#false} assume 4 == ~blastFlag~0; {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L290 TraceCheckUtils]: 139: Hoare triple {87273#false} assume !false; {87273#false} is VALID [2022-04-14 18:41:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-14 18:41:12,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:41:12,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086786518] [2022-04-14 18:41:12,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086786518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:41:12,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:41:12,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:41:12,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691188493] [2022-04-14 18:41:12,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:41:12,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 140 [2022-04-14 18:41:12,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:41:12,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:12,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:41:12,782 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:41:12,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:41:12,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:41:12,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:41:12,783 INFO L87 Difference]: Start difference. First operand 1759 states and 2634 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:14,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:41:16,102 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:41:17,494 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-14 18:41:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:20,044 INFO L93 Difference]: Finished difference Result 4085 states and 6110 transitions. [2022-04-14 18:41:20,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:41:20,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 140 [2022-04-14 18:41:20,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:41:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2022-04-14 18:41:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2022-04-14 18:41:20,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 580 transitions. [2022-04-14 18:41:20,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 580 edges. 580 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:41:20,570 INFO L225 Difference]: With dead ends: 4085 [2022-04-14 18:41:20,570 INFO L226 Difference]: Without dead ends: 2354 [2022-04-14 18:41:20,572 INFO L912 BasicCegarLoop]: 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-14 18:41:20,572 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 120 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-14 18:41:20,572 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 376 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-14 18:41:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2022-04-14 18:41:20,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 1995. [2022-04-14 18:41:20,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:41:20,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2354 states. Second operand has 1995 states, 1990 states have (on average 1.4969849246231155) internal successors, (2979), 1990 states have internal predecessors, (2979), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:20,700 INFO L74 IsIncluded]: Start isIncluded. First operand 2354 states. Second operand has 1995 states, 1990 states have (on average 1.4969849246231155) internal successors, (2979), 1990 states have internal predecessors, (2979), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:20,701 INFO L87 Difference]: Start difference. First operand 2354 states. Second operand has 1995 states, 1990 states have (on average 1.4969849246231155) internal successors, (2979), 1990 states have internal predecessors, (2979), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:20,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:20,832 INFO L93 Difference]: Finished difference Result 2354 states and 3493 transitions. [2022-04-14 18:41:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 3493 transitions. [2022-04-14 18:41:20,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:41:20,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:41:20,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 1995 states, 1990 states have (on average 1.4969849246231155) internal successors, (2979), 1990 states have internal predecessors, (2979), 3 states have call successors, (3), 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 2354 states. [2022-04-14 18:41:20,837 INFO L87 Difference]: Start difference. First operand has 1995 states, 1990 states have (on average 1.4969849246231155) internal successors, (2979), 1990 states have internal predecessors, (2979), 3 states have call successors, (3), 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 2354 states. [2022-04-14 18:41:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:20,970 INFO L93 Difference]: Finished difference Result 2354 states and 3493 transitions. [2022-04-14 18:41:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 3493 transitions. [2022-04-14 18:41:20,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:41:20,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:41:20,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:41:20,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:41:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1990 states have (on average 1.4969849246231155) internal successors, (2979), 1990 states have internal predecessors, (2979), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2983 transitions. [2022-04-14 18:41:21,082 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2983 transitions. Word has length 140 [2022-04-14 18:41:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:41:21,082 INFO L478 AbstractCegarLoop]: Abstraction has 1995 states and 2983 transitions. [2022-04-14 18:41:21,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:21,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2983 transitions. [2022-04-14 18:41:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-14 18:41:21,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:41:21,084 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:41:21,084 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-14 18:41:21,084 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:41:21,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:41:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1433442101, now seen corresponding path program 1 times [2022-04-14 18:41:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:41:21,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548613791] [2022-04-14 18:41:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:41:21,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:41:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:21,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:41:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:21,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {98708#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {98701#true} is VALID [2022-04-14 18:41:21,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {98701#true} assume true; {98701#true} is VALID [2022-04-14 18:41:21,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98701#true} {98701#true} #690#return; {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {98701#true} call ULTIMATE.init(); {98708#(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-14 18:41:21,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {98708#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {98701#true} assume true; {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98701#true} {98701#true} #690#return; {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {98701#true} call #t~ret161 := main(); {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {98701#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; {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {98701#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L272 TraceCheckUtils]: 7: Hoare triple {98701#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {98701#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); {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {98701#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; {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {98701#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; {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {98701#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {98701#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {98701#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {98701#true} assume !false; {98701#true} is VALID [2022-04-14 18:41:21,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {98701#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); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {98701#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {98701#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {98701#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {98701#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {98701#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {98701#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {98701#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {98701#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {98701#true} assume 8464 == #t~mem55;havoc #t~mem55; {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {98701#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; {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {98701#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {98701#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); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {98701#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); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {98701#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {98701#true} ~skip~0 := 0; {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {98701#true} assume !false; {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {98701#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); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {98701#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {98701#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {98701#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 36: Hoare triple {98701#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,190 INFO L290 TraceCheckUtils]: 37: Hoare triple {98701#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 38: Hoare triple {98701#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {98701#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {98701#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {98701#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {98701#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {98701#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {98701#true} assume 8496 == #t~mem58;havoc #t~mem58; {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {98701#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {98701#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {98701#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {98701#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {98701#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {98701#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); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {98701#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 52: Hoare triple {98701#true} ~skip~0 := 0; {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 53: Hoare triple {98701#true} assume !false; {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 54: Hoare triple {98701#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); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 55: Hoare triple {98701#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {98701#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 57: Hoare triple {98701#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 58: Hoare triple {98701#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,191 INFO L290 TraceCheckUtils]: 59: Hoare triple {98701#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,192 INFO L290 TraceCheckUtils]: 60: Hoare triple {98701#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,192 INFO L290 TraceCheckUtils]: 61: Hoare triple {98701#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,192 INFO L290 TraceCheckUtils]: 62: Hoare triple {98701#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,192 INFO L290 TraceCheckUtils]: 63: Hoare triple {98701#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,192 INFO L290 TraceCheckUtils]: 64: Hoare triple {98701#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,192 INFO L290 TraceCheckUtils]: 65: Hoare triple {98701#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,192 INFO L290 TraceCheckUtils]: 66: Hoare triple {98701#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,192 INFO L290 TraceCheckUtils]: 67: Hoare triple {98701#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {98701#true} is VALID [2022-04-14 18:41:21,192 INFO L290 TraceCheckUtils]: 68: Hoare triple {98701#true} assume 8512 == #t~mem60;havoc #t~mem60; {98701#true} is VALID [2022-04-14 18:41:21,192 INFO L290 TraceCheckUtils]: 69: Hoare triple {98701#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); {98701#true} is VALID [2022-04-14 18:41:21,192 INFO L290 TraceCheckUtils]: 70: Hoare triple {98701#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; {98701#true} is VALID [2022-04-14 18:41:21,192 INFO L290 TraceCheckUtils]: 71: Hoare triple {98701#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {98701#true} is VALID [2022-04-14 18:41:21,192 INFO L290 TraceCheckUtils]: 72: Hoare triple {98701#true} assume !(~ret~0 <= 0); {98701#true} is VALID [2022-04-14 18:41:21,193 INFO L290 TraceCheckUtils]: 73: Hoare triple {98701#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,194 INFO L290 TraceCheckUtils]: 74: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,194 INFO L290 TraceCheckUtils]: 75: Hoare triple {98706#(= 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; {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,194 INFO L290 TraceCheckUtils]: 76: Hoare triple {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,195 INFO L290 TraceCheckUtils]: 77: Hoare triple {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,197 INFO L290 TraceCheckUtils]: 78: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,197 INFO L290 TraceCheckUtils]: 79: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,201 INFO L290 TraceCheckUtils]: 80: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,202 INFO L290 TraceCheckUtils]: 82: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,202 INFO L290 TraceCheckUtils]: 83: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,202 INFO L290 TraceCheckUtils]: 84: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,202 INFO L290 TraceCheckUtils]: 85: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,207 INFO L290 TraceCheckUtils]: 86: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,207 INFO L290 TraceCheckUtils]: 87: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,207 INFO L290 TraceCheckUtils]: 88: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,208 INFO L290 TraceCheckUtils]: 89: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,209 INFO L290 TraceCheckUtils]: 90: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,209 INFO L290 TraceCheckUtils]: 91: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,209 INFO L290 TraceCheckUtils]: 92: Hoare triple {98706#(= 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); {98706#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:21,210 INFO L290 TraceCheckUtils]: 93: Hoare triple {98706#(= 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); {98707#(= |ssl3_accept_#t~mem62| 8528)} is VALID [2022-04-14 18:41:21,210 INFO L290 TraceCheckUtils]: 94: Hoare triple {98707#(= |ssl3_accept_#t~mem62| 8528)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,210 INFO L290 TraceCheckUtils]: 95: Hoare triple {98702#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,210 INFO L290 TraceCheckUtils]: 96: Hoare triple {98702#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,210 INFO L290 TraceCheckUtils]: 97: Hoare triple {98702#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,210 INFO L290 TraceCheckUtils]: 98: Hoare triple {98702#false} assume 8560 == #t~mem66;havoc #t~mem66; {98702#false} is VALID [2022-04-14 18:41:21,210 INFO L290 TraceCheckUtils]: 99: Hoare triple {98702#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {98702#false} is VALID [2022-04-14 18:41:21,210 INFO L290 TraceCheckUtils]: 100: Hoare triple {98702#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,210 INFO L290 TraceCheckUtils]: 101: Hoare triple {98702#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); {98702#false} is VALID [2022-04-14 18:41:21,210 INFO L290 TraceCheckUtils]: 102: Hoare triple {98702#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98702#false} is VALID [2022-04-14 18:41:21,210 INFO L290 TraceCheckUtils]: 103: Hoare triple {98702#false} ~skip~0 := 0; {98702#false} is VALID [2022-04-14 18:41:21,210 INFO L290 TraceCheckUtils]: 104: Hoare triple {98702#false} assume !false; {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 105: Hoare triple {98702#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); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 106: Hoare triple {98702#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 107: Hoare triple {98702#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 108: Hoare triple {98702#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 109: Hoare triple {98702#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 110: Hoare triple {98702#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 111: Hoare triple {98702#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 112: Hoare triple {98702#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 113: Hoare triple {98702#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 114: Hoare triple {98702#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 115: Hoare triple {98702#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 116: Hoare triple {98702#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 117: Hoare triple {98702#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 118: Hoare triple {98702#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 119: Hoare triple {98702#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 120: Hoare triple {98702#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 121: Hoare triple {98702#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 122: Hoare triple {98702#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 123: Hoare triple {98702#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 124: Hoare triple {98702#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,211 INFO L290 TraceCheckUtils]: 125: Hoare triple {98702#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 126: Hoare triple {98702#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 127: Hoare triple {98702#false} assume 8448 == #t~mem68;havoc #t~mem68; {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 128: Hoare triple {98702#false} assume !(~num1~0 > 0); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 129: Hoare triple {98702#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; {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 130: Hoare triple {98702#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); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 131: Hoare triple {98702#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 132: Hoare triple {98702#false} ~skip~0 := 0; {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 133: Hoare triple {98702#false} assume !false; {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 134: Hoare triple {98702#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); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 135: Hoare triple {98702#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 136: Hoare triple {98702#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 137: Hoare triple {98702#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 138: Hoare triple {98702#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 139: Hoare triple {98702#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 140: Hoare triple {98702#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 141: Hoare triple {98702#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 142: Hoare triple {98702#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 143: Hoare triple {98702#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 144: Hoare triple {98702#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 145: Hoare triple {98702#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,212 INFO L290 TraceCheckUtils]: 146: Hoare triple {98702#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 147: Hoare triple {98702#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 148: Hoare triple {98702#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 149: Hoare triple {98702#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 150: Hoare triple {98702#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 151: Hoare triple {98702#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 152: Hoare triple {98702#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 153: Hoare triple {98702#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 154: Hoare triple {98702#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 155: Hoare triple {98702#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 156: Hoare triple {98702#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 157: Hoare triple {98702#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 158: Hoare triple {98702#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 159: Hoare triple {98702#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 160: Hoare triple {98702#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 161: Hoare triple {98702#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 162: Hoare triple {98702#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 163: Hoare triple {98702#false} assume 8640 == #t~mem75;havoc #t~mem75; {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 164: Hoare triple {98702#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 165: Hoare triple {98702#false} assume 4 == ~blastFlag~0; {98702#false} is VALID [2022-04-14 18:41:21,213 INFO L290 TraceCheckUtils]: 166: Hoare triple {98702#false} assume !false; {98702#false} is VALID [2022-04-14 18:41:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-14 18:41:21,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:41:21,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548613791] [2022-04-14 18:41:21,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548613791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:41:21,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:41:21,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:41:21,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859030702] [2022-04-14 18:41:21,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:41:21,215 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 167 [2022-04-14 18:41:21,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:41:21,215 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-14 18:41:21,287 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-14 18:41:21,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:41:21,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:41:21,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:41:21,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:41:21,288 INFO L87 Difference]: Start difference. First operand 1995 states and 2983 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-14 18:41:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:28,472 INFO L93 Difference]: Finished difference Result 4058 states and 6063 transitions. [2022-04-14 18:41:28,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:41:28,472 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 167 [2022-04-14 18:41:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:41:28,473 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-14 18:41:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-14 18:41:28,474 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-14 18:41:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-14 18:41:28,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 484 transitions. [2022-04-14 18:41:28,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:41:28,890 INFO L225 Difference]: With dead ends: 4058 [2022-04-14 18:41:28,890 INFO L226 Difference]: Without dead ends: 2091 [2022-04-14 18:41:28,892 INFO L912 BasicCegarLoop]: 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-14 18:41:28,892 INFO L913 BasicCegarLoop]: 227 mSDtfsCounter, 38 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:41:28,892 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 568 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-14 18:41:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2022-04-14 18:41:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1995. [2022-04-14 18:41:29,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:41:29,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2091 states. Second operand has 1995 states, 1990 states have (on average 1.4949748743718594) internal successors, (2975), 1990 states have internal predecessors, (2975), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:29,036 INFO L74 IsIncluded]: Start isIncluded. First operand 2091 states. Second operand has 1995 states, 1990 states have (on average 1.4949748743718594) internal successors, (2975), 1990 states have internal predecessors, (2975), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:29,037 INFO L87 Difference]: Start difference. First operand 2091 states. Second operand has 1995 states, 1990 states have (on average 1.4949748743718594) internal successors, (2975), 1990 states have internal predecessors, (2975), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:29,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:29,144 INFO L93 Difference]: Finished difference Result 2091 states and 3108 transitions. [2022-04-14 18:41:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3108 transitions. [2022-04-14 18:41:29,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:41:29,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:41:29,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 1995 states, 1990 states have (on average 1.4949748743718594) internal successors, (2975), 1990 states have internal predecessors, (2975), 3 states have call successors, (3), 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 2091 states. [2022-04-14 18:41:29,148 INFO L87 Difference]: Start difference. First operand has 1995 states, 1990 states have (on average 1.4949748743718594) internal successors, (2975), 1990 states have internal predecessors, (2975), 3 states have call successors, (3), 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 2091 states. [2022-04-14 18:41:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:29,253 INFO L93 Difference]: Finished difference Result 2091 states and 3108 transitions. [2022-04-14 18:41:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3108 transitions. [2022-04-14 18:41:29,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:41:29,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:41:29,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:41:29,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:41:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1990 states have (on average 1.4949748743718594) internal successors, (2975), 1990 states have internal predecessors, (2975), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2979 transitions. [2022-04-14 18:41:29,375 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2979 transitions. Word has length 167 [2022-04-14 18:41:29,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:41:29,375 INFO L478 AbstractCegarLoop]: Abstraction has 1995 states and 2979 transitions. [2022-04-14 18:41:29,375 INFO L479 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-14 18:41:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2979 transitions. [2022-04-14 18:41:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-04-14 18:41:29,376 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:41:29,377 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:41:29,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-14 18:41:29,377 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:41:29,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:41:29,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2121866572, now seen corresponding path program 1 times [2022-04-14 18:41:29,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:41:29,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454734711] [2022-04-14 18:41:29,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:41:29,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:41:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:41:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:29,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {109553#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {109545#true} is VALID [2022-04-14 18:41:29,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {109545#true} assume true; {109545#true} is VALID [2022-04-14 18:41:29,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {109545#true} {109545#true} #690#return; {109545#true} is VALID [2022-04-14 18:41:29,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {109545#true} call ULTIMATE.init(); {109553#(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-14 18:41:29,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {109553#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {109545#true} is VALID [2022-04-14 18:41:29,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {109545#true} assume true; {109545#true} is VALID [2022-04-14 18:41:29,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109545#true} {109545#true} #690#return; {109545#true} is VALID [2022-04-14 18:41:29,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {109545#true} call #t~ret161 := main(); {109545#true} is VALID [2022-04-14 18:41:29,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {109545#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; {109545#true} is VALID [2022-04-14 18:41:29,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {109545#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,510 INFO L272 TraceCheckUtils]: 7: Hoare triple {109545#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {109545#true} is VALID [2022-04-14 18:41:29,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {109545#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); {109545#true} is VALID [2022-04-14 18:41:29,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {109545#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; {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {109545#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; {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {109545#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {109545#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {109545#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {109545#true} assume !false; {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {109545#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); {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {109545#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {109545#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {109545#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {109545#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {109545#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {109545#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {109545#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {109545#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {109545#true} assume 8464 == #t~mem55;havoc #t~mem55; {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {109545#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; {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {109545#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {109545#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); {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {109545#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); {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {109545#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109545#true} is VALID [2022-04-14 18:41:29,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {109545#true} ~skip~0 := 0; {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {109545#true} assume !false; {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {109545#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); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {109545#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {109545#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {109545#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 36: Hoare triple {109545#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {109545#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {109545#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {109545#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {109545#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {109545#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 42: Hoare triple {109545#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 43: Hoare triple {109545#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 44: Hoare triple {109545#true} assume 8496 == #t~mem58;havoc #t~mem58; {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 45: Hoare triple {109545#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 46: Hoare triple {109545#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 47: Hoare triple {109545#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {109545#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 49: Hoare triple {109545#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 50: Hoare triple {109545#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); {109545#true} is VALID [2022-04-14 18:41:29,512 INFO L290 TraceCheckUtils]: 51: Hoare triple {109545#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 52: Hoare triple {109545#true} ~skip~0 := 0; {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 53: Hoare triple {109545#true} assume !false; {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 54: Hoare triple {109545#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); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 55: Hoare triple {109545#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 56: Hoare triple {109545#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 57: Hoare triple {109545#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 58: Hoare triple {109545#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 59: Hoare triple {109545#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 60: Hoare triple {109545#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 61: Hoare triple {109545#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 62: Hoare triple {109545#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 63: Hoare triple {109545#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 64: Hoare triple {109545#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 65: Hoare triple {109545#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 66: Hoare triple {109545#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 67: Hoare triple {109545#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 68: Hoare triple {109545#true} assume 8512 == #t~mem60;havoc #t~mem60; {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 69: Hoare triple {109545#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); {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 70: Hoare triple {109545#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; {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 71: Hoare triple {109545#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {109545#true} is VALID [2022-04-14 18:41:29,513 INFO L290 TraceCheckUtils]: 72: Hoare triple {109545#true} assume !(~ret~0 <= 0); {109545#true} is VALID [2022-04-14 18:41:29,514 INFO L290 TraceCheckUtils]: 73: Hoare triple {109545#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {109545#true} is VALID [2022-04-14 18:41:29,514 INFO L290 TraceCheckUtils]: 74: Hoare triple {109545#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); {109545#true} is VALID [2022-04-14 18:41:29,514 INFO L290 TraceCheckUtils]: 75: Hoare triple {109545#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109545#true} is VALID [2022-04-14 18:41:29,514 INFO L290 TraceCheckUtils]: 76: Hoare triple {109545#true} ~skip~0 := 0; {109545#true} is VALID [2022-04-14 18:41:29,514 INFO L290 TraceCheckUtils]: 77: Hoare triple {109545#true} assume !false; {109545#true} is VALID [2022-04-14 18:41:29,514 INFO L290 TraceCheckUtils]: 78: Hoare triple {109545#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); {109550#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:29,514 INFO L290 TraceCheckUtils]: 79: Hoare triple {109550#(= |ssl3_accept_#t~mem47| (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); {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:29,515 INFO L290 TraceCheckUtils]: 80: Hoare triple {109551#(not (= 12292 (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); {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:29,515 INFO L290 TraceCheckUtils]: 81: Hoare triple {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 8192 == #t~mem49;havoc #t~mem49; {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:29,516 INFO L290 TraceCheckUtils]: 82: Hoare triple {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:29,516 INFO L290 TraceCheckUtils]: 83: Hoare triple {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:29,516 INFO L290 TraceCheckUtils]: 84: Hoare triple {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:29,517 INFO L290 TraceCheckUtils]: 85: Hoare triple {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:29,517 INFO L290 TraceCheckUtils]: 86: Hoare triple {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:41:29,518 INFO L290 TraceCheckUtils]: 87: Hoare triple {109551#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {109552#(not (= 12292 |ssl3_accept_#t~mem85|))} is VALID [2022-04-14 18:41:29,518 INFO L290 TraceCheckUtils]: 88: Hoare triple {109552#(not (= 12292 |ssl3_accept_#t~mem85|))} 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); {109546#false} is VALID [2022-04-14 18:41:29,518 INFO L290 TraceCheckUtils]: 89: Hoare triple {109546#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); {109546#false} is VALID [2022-04-14 18:41:29,518 INFO L290 TraceCheckUtils]: 90: Hoare triple {109546#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109546#false} is VALID [2022-04-14 18:41:29,518 INFO L290 TraceCheckUtils]: 91: Hoare triple {109546#false} ~skip~0 := 0; {109546#false} is VALID [2022-04-14 18:41:29,518 INFO L290 TraceCheckUtils]: 92: Hoare triple {109546#false} assume !false; {109546#false} is VALID [2022-04-14 18:41:29,518 INFO L290 TraceCheckUtils]: 93: Hoare triple {109546#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); {109546#false} is VALID [2022-04-14 18:41:29,518 INFO L290 TraceCheckUtils]: 94: Hoare triple {109546#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 95: Hoare triple {109546#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 96: Hoare triple {109546#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 97: Hoare triple {109546#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 98: Hoare triple {109546#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 99: Hoare triple {109546#false} assume 8480 == #t~mem52;havoc #t~mem52; {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 100: Hoare triple {109546#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; {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 101: Hoare triple {109546#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); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 102: Hoare triple {109546#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); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 103: Hoare triple {109546#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 104: Hoare triple {109546#false} ~skip~0 := 0; {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 105: Hoare triple {109546#false} assume !false; {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 106: Hoare triple {109546#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); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 107: Hoare triple {109546#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 108: Hoare triple {109546#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 109: Hoare triple {109546#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 110: Hoare triple {109546#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 111: Hoare triple {109546#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 112: Hoare triple {109546#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 113: Hoare triple {109546#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 114: Hoare triple {109546#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,519 INFO L290 TraceCheckUtils]: 115: Hoare triple {109546#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 116: Hoare triple {109546#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 117: Hoare triple {109546#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 118: Hoare triple {109546#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 119: Hoare triple {109546#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 120: Hoare triple {109546#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 121: Hoare triple {109546#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 122: Hoare triple {109546#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 123: Hoare triple {109546#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 124: Hoare triple {109546#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 125: Hoare triple {109546#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 126: Hoare triple {109546#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 127: Hoare triple {109546#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 128: Hoare triple {109546#false} assume 8448 == #t~mem68;havoc #t~mem68; {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 129: Hoare triple {109546#false} assume !(~num1~0 > 0); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 130: Hoare triple {109546#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; {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 131: Hoare triple {109546#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); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 132: Hoare triple {109546#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 133: Hoare triple {109546#false} ~skip~0 := 0; {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 134: Hoare triple {109546#false} assume !false; {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 135: Hoare triple {109546#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); {109546#false} is VALID [2022-04-14 18:41:29,520 INFO L290 TraceCheckUtils]: 136: Hoare triple {109546#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 137: Hoare triple {109546#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 138: Hoare triple {109546#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 139: Hoare triple {109546#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 140: Hoare triple {109546#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 141: Hoare triple {109546#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 142: Hoare triple {109546#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 143: Hoare triple {109546#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 144: Hoare triple {109546#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 145: Hoare triple {109546#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 146: Hoare triple {109546#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 147: Hoare triple {109546#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 148: Hoare triple {109546#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 149: Hoare triple {109546#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 150: Hoare triple {109546#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 151: Hoare triple {109546#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 152: Hoare triple {109546#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 153: Hoare triple {109546#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 154: Hoare triple {109546#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 155: Hoare triple {109546#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 156: Hoare triple {109546#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,521 INFO L290 TraceCheckUtils]: 157: Hoare triple {109546#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,522 INFO L290 TraceCheckUtils]: 158: Hoare triple {109546#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,522 INFO L290 TraceCheckUtils]: 159: Hoare triple {109546#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,522 INFO L290 TraceCheckUtils]: 160: Hoare triple {109546#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,522 INFO L290 TraceCheckUtils]: 161: Hoare triple {109546#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,522 INFO L290 TraceCheckUtils]: 162: Hoare triple {109546#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,522 INFO L290 TraceCheckUtils]: 163: Hoare triple {109546#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {109546#false} is VALID [2022-04-14 18:41:29,522 INFO L290 TraceCheckUtils]: 164: Hoare triple {109546#false} assume 8640 == #t~mem75;havoc #t~mem75; {109546#false} is VALID [2022-04-14 18:41:29,522 INFO L290 TraceCheckUtils]: 165: Hoare triple {109546#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {109546#false} is VALID [2022-04-14 18:41:29,522 INFO L290 TraceCheckUtils]: 166: Hoare triple {109546#false} assume 4 == ~blastFlag~0; {109546#false} is VALID [2022-04-14 18:41:29,522 INFO L290 TraceCheckUtils]: 167: Hoare triple {109546#false} assume !false; {109546#false} is VALID [2022-04-14 18:41:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-14 18:41:29,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:41:29,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454734711] [2022-04-14 18:41:29,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454734711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:41:29,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:41:29,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 18:41:29,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063384404] [2022-04-14 18:41:29,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:41:29,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (3), 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 168 [2022-04-14 18:41:29,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:41:29,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:29,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:41:29,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 18:41:29,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:41:29,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 18:41:29,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 18:41:29,595 INFO L87 Difference]: Start difference. First operand 1995 states and 2979 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:36,559 INFO L93 Difference]: Finished difference Result 4002 states and 5978 transitions. [2022-04-14 18:41:36,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 18:41:36,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (3), 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 168 [2022-04-14 18:41:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:41:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 440 transitions. [2022-04-14 18:41:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 440 transitions. [2022-04-14 18:41:36,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 440 transitions. [2022-04-14 18:41:36,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:41:36,963 INFO L225 Difference]: With dead ends: 4002 [2022-04-14 18:41:36,963 INFO L226 Difference]: Without dead ends: 2035 [2022-04-14 18:41:36,965 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 18:41:36,965 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 151 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-14 18:41:36,965 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 371 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-14 18:41:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2022-04-14 18:41:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2031. [2022-04-14 18:41:37,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:41:37,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2035 states. Second operand has 2031 states, 2026 states have (on average 1.4901283316880554) internal successors, (3019), 2026 states have internal predecessors, (3019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:37,086 INFO L74 IsIncluded]: Start isIncluded. First operand 2035 states. Second operand has 2031 states, 2026 states have (on average 1.4901283316880554) internal successors, (3019), 2026 states have internal predecessors, (3019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:37,087 INFO L87 Difference]: Start difference. First operand 2035 states. Second operand has 2031 states, 2026 states have (on average 1.4901283316880554) internal successors, (3019), 2026 states have internal predecessors, (3019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:37,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:37,188 INFO L93 Difference]: Finished difference Result 2035 states and 3027 transitions. [2022-04-14 18:41:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3027 transitions. [2022-04-14 18:41:37,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:41:37,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:41:37,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 2031 states, 2026 states have (on average 1.4901283316880554) internal successors, (3019), 2026 states have internal predecessors, (3019), 3 states have call successors, (3), 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 2035 states. [2022-04-14 18:41:37,191 INFO L87 Difference]: Start difference. First operand has 2031 states, 2026 states have (on average 1.4901283316880554) internal successors, (3019), 2026 states have internal predecessors, (3019), 3 states have call successors, (3), 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 2035 states. [2022-04-14 18:41:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:37,292 INFO L93 Difference]: Finished difference Result 2035 states and 3027 transitions. [2022-04-14 18:41:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3027 transitions. [2022-04-14 18:41:37,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:41:37,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:41:37,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:41:37,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:41:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2031 states, 2026 states have (on average 1.4901283316880554) internal successors, (3019), 2026 states have internal predecessors, (3019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 3023 transitions. [2022-04-14 18:41:37,406 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 3023 transitions. Word has length 168 [2022-04-14 18:41:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:41:37,406 INFO L478 AbstractCegarLoop]: Abstraction has 2031 states and 3023 transitions. [2022-04-14 18:41:37,406 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 3023 transitions. [2022-04-14 18:41:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-14 18:41:37,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:41:37,407 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:41:37,408 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-14 18:41:37,408 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:41:37,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:41:37,408 INFO L85 PathProgramCache]: Analyzing trace with hash -210905305, now seen corresponding path program 1 times [2022-04-14 18:41:37,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:41:37,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157302131] [2022-04-14 18:41:37,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:41:37,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:41:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:37,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:41:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:37,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {120257#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {120248#true} is VALID [2022-04-14 18:41:37,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {120248#true} assume true; {120248#true} is VALID [2022-04-14 18:41:37,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120248#true} {120248#true} #690#return; {120248#true} is VALID [2022-04-14 18:41:37,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {120248#true} call ULTIMATE.init(); {120257#(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-14 18:41:37,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {120257#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {120248#true} is VALID [2022-04-14 18:41:37,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {120248#true} assume true; {120248#true} is VALID [2022-04-14 18:41:37,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120248#true} {120248#true} #690#return; {120248#true} is VALID [2022-04-14 18:41:37,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {120248#true} call #t~ret161 := main(); {120248#true} is VALID [2022-04-14 18:41:37,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {120248#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; {120248#true} is VALID [2022-04-14 18:41:37,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {120248#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {120253#(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-14 18:41:37,730 INFO L272 TraceCheckUtils]: 7: Hoare triple {120253#(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); {120254#(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-14 18:41:37,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {120254#(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); {120255#(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-14 18:41:37,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {120255#(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; {120255#(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-14 18:41:37,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {120255#(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; {120255#(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-14 18:41:37,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {120255#(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)))); {120255#(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-14 18:41:37,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {120255#(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); {120256#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-14 18:41:37,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {120256#(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; {120249#false} is VALID [2022-04-14 18:41:37,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {120249#false} assume !false; {120249#false} is VALID [2022-04-14 18:41:37,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {120249#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); {120249#false} is VALID [2022-04-14 18:41:37,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {120249#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {120249#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {120249#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {120249#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {120249#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {120249#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {120249#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {120249#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {120249#false} assume 8464 == #t~mem55;havoc #t~mem55; {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {120249#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; {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {120249#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {120249#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); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {120249#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); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {120249#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {120249#false} ~skip~0 := 0; {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {120249#false} assume !false; {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {120249#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); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {120249#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {120249#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {120249#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {120249#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {120249#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {120249#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {120249#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {120249#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 41: Hoare triple {120249#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 42: Hoare triple {120249#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 43: Hoare triple {120249#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 44: Hoare triple {120249#false} assume 8496 == #t~mem58;havoc #t~mem58; {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 45: Hoare triple {120249#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 46: Hoare triple {120249#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 47: Hoare triple {120249#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 48: Hoare triple {120249#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 49: Hoare triple {120249#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {120249#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); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 51: Hoare triple {120249#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 52: Hoare triple {120249#false} ~skip~0 := 0; {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {120249#false} assume !false; {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {120249#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); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 55: Hoare triple {120249#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {120249#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {120249#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {120249#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 59: Hoare triple {120249#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 60: Hoare triple {120249#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 61: Hoare triple {120249#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 62: Hoare triple {120249#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 63: Hoare triple {120249#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {120249#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {120249#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 66: Hoare triple {120249#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 67: Hoare triple {120249#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 68: Hoare triple {120249#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 69: Hoare triple {120249#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 70: Hoare triple {120249#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 71: Hoare triple {120249#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 72: Hoare triple {120249#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 73: Hoare triple {120249#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 74: Hoare triple {120249#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 75: Hoare triple {120249#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 76: Hoare triple {120249#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 77: Hoare triple {120249#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 78: Hoare triple {120249#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,737 INFO L290 TraceCheckUtils]: 79: Hoare triple {120249#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 80: Hoare triple {120249#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 81: Hoare triple {120249#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 82: Hoare triple {120249#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 83: Hoare triple {120249#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 84: Hoare triple {120249#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 85: Hoare triple {120249#false} assume 8656 == #t~mem77;havoc #t~mem77; {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 86: Hoare triple {120249#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 87: Hoare triple {120249#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 88: Hoare triple {120249#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 89: Hoare triple {120249#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 90: Hoare triple {120249#false} assume !(0 == ~tmp___10~0); {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 91: Hoare triple {120249#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); {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 92: Hoare triple {120249#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 93: Hoare triple {120249#false} ~skip~0 := 0; {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 94: Hoare triple {120249#false} assume !false; {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 95: Hoare triple {120249#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); {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 96: Hoare triple {120249#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 97: Hoare triple {120249#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 98: Hoare triple {120249#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,738 INFO L290 TraceCheckUtils]: 99: Hoare triple {120249#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 100: Hoare triple {120249#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 101: Hoare triple {120249#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 102: Hoare triple {120249#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 103: Hoare triple {120249#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 104: Hoare triple {120249#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 105: Hoare triple {120249#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 106: Hoare triple {120249#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 107: Hoare triple {120249#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 108: Hoare triple {120249#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 109: Hoare triple {120249#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 110: Hoare triple {120249#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 111: Hoare triple {120249#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 112: Hoare triple {120249#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 113: Hoare triple {120249#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 114: Hoare triple {120249#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 115: Hoare triple {120249#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 116: Hoare triple {120249#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 117: Hoare triple {120249#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 118: Hoare triple {120249#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 119: Hoare triple {120249#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,739 INFO L290 TraceCheckUtils]: 120: Hoare triple {120249#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 121: Hoare triple {120249#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 122: Hoare triple {120249#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 123: Hoare triple {120249#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 124: Hoare triple {120249#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 125: Hoare triple {120249#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 126: Hoare triple {120249#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 127: Hoare triple {120249#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 128: Hoare triple {120249#false} assume 8672 == #t~mem79;havoc #t~mem79; {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 129: Hoare triple {120249#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 130: Hoare triple {120249#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 131: Hoare triple {120249#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); {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 132: Hoare triple {120249#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; {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 133: Hoare triple {120249#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 134: Hoare triple {120249#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); {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 135: Hoare triple {120249#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 136: Hoare triple {120249#false} ~skip~0 := 0; {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 137: Hoare triple {120249#false} assume !false; {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 138: Hoare triple {120249#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); {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 139: Hoare triple {120249#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 140: Hoare triple {120249#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,740 INFO L290 TraceCheckUtils]: 141: Hoare triple {120249#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 142: Hoare triple {120249#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 143: Hoare triple {120249#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 144: Hoare triple {120249#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 145: Hoare triple {120249#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 146: Hoare triple {120249#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 147: Hoare triple {120249#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 148: Hoare triple {120249#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 149: Hoare triple {120249#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 150: Hoare triple {120249#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 151: Hoare triple {120249#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 152: Hoare triple {120249#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 153: Hoare triple {120249#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 154: Hoare triple {120249#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 155: Hoare triple {120249#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 156: Hoare triple {120249#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 157: Hoare triple {120249#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 158: Hoare triple {120249#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 159: Hoare triple {120249#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 160: Hoare triple {120249#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 161: Hoare triple {120249#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,741 INFO L290 TraceCheckUtils]: 162: Hoare triple {120249#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,742 INFO L290 TraceCheckUtils]: 163: Hoare triple {120249#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,742 INFO L290 TraceCheckUtils]: 164: Hoare triple {120249#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,742 INFO L290 TraceCheckUtils]: 165: Hoare triple {120249#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,742 INFO L290 TraceCheckUtils]: 166: Hoare triple {120249#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {120249#false} is VALID [2022-04-14 18:41:37,742 INFO L290 TraceCheckUtils]: 167: Hoare triple {120249#false} assume 8640 == #t~mem75;havoc #t~mem75; {120249#false} is VALID [2022-04-14 18:41:37,742 INFO L290 TraceCheckUtils]: 168: Hoare triple {120249#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {120249#false} is VALID [2022-04-14 18:41:37,742 INFO L290 TraceCheckUtils]: 169: Hoare triple {120249#false} assume 4 == ~blastFlag~0; {120249#false} is VALID [2022-04-14 18:41:37,742 INFO L290 TraceCheckUtils]: 170: Hoare triple {120249#false} assume !false; {120249#false} is VALID [2022-04-14 18:41:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-04-14 18:41:37,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:41:37,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157302131] [2022-04-14 18:41:37,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157302131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:41:37,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:41:37,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-14 18:41:37,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112045579] [2022-04-14 18:41:37,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:41:37,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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 171 [2022-04-14 18:41:37,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:41:37,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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-14 18:41:37,790 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-14 18:41:37,790 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 18:41:37,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:41:37,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 18:41:37,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-14 18:41:37,791 INFO L87 Difference]: Start difference. First operand 2031 states and 3023 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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-14 18:41:42,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:41:45,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:41:48,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:48,185 INFO L93 Difference]: Finished difference Result 4055 states and 6038 transitions. [2022-04-14 18:41:48,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 18:41:48,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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 171 [2022-04-14 18:41:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:41:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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-14 18:41:48,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-14 18:41:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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-14 18:41:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-14 18:41:48,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 422 transitions. [2022-04-14 18:41:48,431 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-14 18:41:48,557 INFO L225 Difference]: With dead ends: 4055 [2022-04-14 18:41:48,557 INFO L226 Difference]: Without dead ends: 2031 [2022-04-14 18:41:48,559 INFO L912 BasicCegarLoop]: 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-14 18:41:48,559 INFO L913 BasicCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s 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, 5.7s IncrementalHoareTripleChecker+Time [2022-04-14 18:41:48,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 841 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-04-14 18:41:48,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2022-04-14 18:41:48,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2031. [2022-04-14 18:41:48,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:41:48,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2031 states. Second operand has 2031 states, 2026 states have (on average 1.4896347482724581) internal successors, (3018), 2026 states have internal predecessors, (3018), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:48,685 INFO L74 IsIncluded]: Start isIncluded. First operand 2031 states. Second operand has 2031 states, 2026 states have (on average 1.4896347482724581) internal successors, (3018), 2026 states have internal predecessors, (3018), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:48,686 INFO L87 Difference]: Start difference. First operand 2031 states. Second operand has 2031 states, 2026 states have (on average 1.4896347482724581) internal successors, (3018), 2026 states have internal predecessors, (3018), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:48,786 INFO L93 Difference]: Finished difference Result 2031 states and 3022 transitions. [2022-04-14 18:41:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 3022 transitions. [2022-04-14 18:41:48,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:41:48,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:41:48,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 2031 states, 2026 states have (on average 1.4896347482724581) internal successors, (3018), 2026 states have internal predecessors, (3018), 3 states have call successors, (3), 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 2031 states. [2022-04-14 18:41:48,790 INFO L87 Difference]: Start difference. First operand has 2031 states, 2026 states have (on average 1.4896347482724581) internal successors, (3018), 2026 states have internal predecessors, (3018), 3 states have call successors, (3), 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 2031 states. [2022-04-14 18:41:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:41:48,890 INFO L93 Difference]: Finished difference Result 2031 states and 3022 transitions. [2022-04-14 18:41:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 3022 transitions. [2022-04-14 18:41:48,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:41:48,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:41:48,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:41:48,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:41:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2031 states, 2026 states have (on average 1.4896347482724581) internal successors, (3018), 2026 states have internal predecessors, (3018), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:41:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 3022 transitions. [2022-04-14 18:41:49,007 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 3022 transitions. Word has length 171 [2022-04-14 18:41:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:41:49,007 INFO L478 AbstractCegarLoop]: Abstraction has 2031 states and 3022 transitions. [2022-04-14 18:41:49,007 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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-14 18:41:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 3022 transitions. [2022-04-14 18:41:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-14 18:41:49,008 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:41:49,008 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:41:49,009 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-14 18:41:49,009 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:41:49,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:41:49,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2134155735, now seen corresponding path program 1 times [2022-04-14 18:41:49,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:41:49,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713197325] [2022-04-14 18:41:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:41:49,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:41:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:50,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:41:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:50,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {131022#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {131007#true} is VALID [2022-04-14 18:41:50,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {131007#true} assume true; {131007#true} is VALID [2022-04-14 18:41:50,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131007#true} {131007#true} #690#return; {131007#true} is VALID [2022-04-14 18:41:50,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {131007#true} call ULTIMATE.init(); {131022#(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-14 18:41:50,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {131022#(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_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {131007#true} is VALID [2022-04-14 18:41:50,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {131007#true} assume true; {131007#true} is VALID [2022-04-14 18:41:50,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131007#true} {131007#true} #690#return; {131007#true} is VALID [2022-04-14 18:41:50,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {131007#true} call #t~ret161 := main(); {131007#true} is VALID [2022-04-14 18:41:50,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {131007#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; {131012#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 176 main_~s~0.offset)) 0) (= (select |#valid| main_~s~0.base) 1) (<= main_~s~0.offset 0))} is VALID [2022-04-14 18:41:50,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {131012#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 176 main_~s~0.offset)) 0) (= (select |#valid| main_~s~0.base) 1) (<= main_~s~0.offset 0))} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {131013#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 176 main_~s~0.offset)) 0) (<= main_~s~0.offset 0))} is VALID [2022-04-14 18:41:50,055 INFO L272 TraceCheckUtils]: 7: Hoare triple {131013#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 176 main_~s~0.offset)) 0) (<= main_~s~0.offset 0))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {131014#(and (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 84 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 176 |ssl3_accept_#in~s.offset|)) 0) (<= |ssl3_accept_#in~s.offset| 0))} is VALID [2022-04-14 18:41:50,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {131014#(and (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 84 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 176 |ssl3_accept_#in~s.offset|)) 0) (<= |ssl3_accept_#in~s.offset| 0))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !false; {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume 8464 == #t~mem55;havoc #t~mem55; {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-14 18:41:50,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {131015#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} ~skip~0 := 0; {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume !false; {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 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); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,069 INFO L290 TraceCheckUtils]: 34: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,070 INFO L290 TraceCheckUtils]: 35: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,070 INFO L290 TraceCheckUtils]: 36: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,071 INFO L290 TraceCheckUtils]: 38: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,072 INFO L290 TraceCheckUtils]: 40: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,073 INFO L290 TraceCheckUtils]: 43: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume 8496 == #t~mem58;havoc #t~mem58; {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,076 INFO L290 TraceCheckUtils]: 48: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-14 18:41:50,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {131016#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (<= ssl3_accept_~s.offset 0))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,077 INFO L290 TraceCheckUtils]: 50: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,078 INFO L290 TraceCheckUtils]: 51: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,078 INFO L290 TraceCheckUtils]: 52: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} ~skip~0 := 0; {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,079 INFO L290 TraceCheckUtils]: 53: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !false; {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,079 INFO L290 TraceCheckUtils]: 54: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,080 INFO L290 TraceCheckUtils]: 55: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,080 INFO L290 TraceCheckUtils]: 56: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,081 INFO L290 TraceCheckUtils]: 57: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,081 INFO L290 TraceCheckUtils]: 58: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,082 INFO L290 TraceCheckUtils]: 59: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,082 INFO L290 TraceCheckUtils]: 60: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,083 INFO L290 TraceCheckUtils]: 61: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,083 INFO L290 TraceCheckUtils]: 62: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,084 INFO L290 TraceCheckUtils]: 63: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,084 INFO L290 TraceCheckUtils]: 64: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,085 INFO L290 TraceCheckUtils]: 65: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,085 INFO L290 TraceCheckUtils]: 66: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,086 INFO L290 TraceCheckUtils]: 67: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,086 INFO L290 TraceCheckUtils]: 68: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,087 INFO L290 TraceCheckUtils]: 69: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,087 INFO L290 TraceCheckUtils]: 70: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,088 INFO L290 TraceCheckUtils]: 71: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,088 INFO L290 TraceCheckUtils]: 72: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,089 INFO L290 TraceCheckUtils]: 73: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,089 INFO L290 TraceCheckUtils]: 74: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,090 INFO L290 TraceCheckUtils]: 75: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,090 INFO L290 TraceCheckUtils]: 76: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,090 INFO L290 TraceCheckUtils]: 77: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,091 INFO L290 TraceCheckUtils]: 78: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,091 INFO L290 TraceCheckUtils]: 79: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,092 INFO L290 TraceCheckUtils]: 80: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,092 INFO L290 TraceCheckUtils]: 81: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,093 INFO L290 TraceCheckUtils]: 82: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,093 INFO L290 TraceCheckUtils]: 83: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,094 INFO L290 TraceCheckUtils]: 84: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,094 INFO L290 TraceCheckUtils]: 85: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume 8656 == #t~mem77;havoc #t~mem77; {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-14 18:41:50,095 INFO L290 TraceCheckUtils]: 86: Hoare triple {131017#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)) 0) (not (= 0 (+ (- 88) ssl3_accept_~s.offset (* (- 1) (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))) (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,096 INFO L290 TraceCheckUtils]: 87: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,096 INFO L290 TraceCheckUtils]: 88: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,097 INFO L290 TraceCheckUtils]: 89: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,097 INFO L290 TraceCheckUtils]: 90: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(0 == ~tmp___10~0); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,098 INFO L290 TraceCheckUtils]: 91: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,098 INFO L290 TraceCheckUtils]: 92: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,098 INFO L290 TraceCheckUtils]: 93: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} ~skip~0 := 0; {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,099 INFO L290 TraceCheckUtils]: 94: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !false; {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,099 INFO L290 TraceCheckUtils]: 95: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,099 INFO L290 TraceCheckUtils]: 96: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,100 INFO L290 TraceCheckUtils]: 97: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,100 INFO L290 TraceCheckUtils]: 98: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,100 INFO L290 TraceCheckUtils]: 99: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,101 INFO L290 TraceCheckUtils]: 100: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,101 INFO L290 TraceCheckUtils]: 101: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,101 INFO L290 TraceCheckUtils]: 102: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,102 INFO L290 TraceCheckUtils]: 103: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,102 INFO L290 TraceCheckUtils]: 104: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,102 INFO L290 TraceCheckUtils]: 105: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,103 INFO L290 TraceCheckUtils]: 106: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,103 INFO L290 TraceCheckUtils]: 107: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,104 INFO L290 TraceCheckUtils]: 108: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,104 INFO L290 TraceCheckUtils]: 109: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,104 INFO L290 TraceCheckUtils]: 110: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,105 INFO L290 TraceCheckUtils]: 111: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,105 INFO L290 TraceCheckUtils]: 112: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,105 INFO L290 TraceCheckUtils]: 113: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,106 INFO L290 TraceCheckUtils]: 114: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,106 INFO L290 TraceCheckUtils]: 115: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,106 INFO L290 TraceCheckUtils]: 116: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,107 INFO L290 TraceCheckUtils]: 117: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,107 INFO L290 TraceCheckUtils]: 118: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,107 INFO L290 TraceCheckUtils]: 119: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,108 INFO L290 TraceCheckUtils]: 120: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,108 INFO L290 TraceCheckUtils]: 121: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,108 INFO L290 TraceCheckUtils]: 122: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,109 INFO L290 TraceCheckUtils]: 123: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,109 INFO L290 TraceCheckUtils]: 124: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,109 INFO L290 TraceCheckUtils]: 125: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,110 INFO L290 TraceCheckUtils]: 126: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,110 INFO L290 TraceCheckUtils]: 127: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,110 INFO L290 TraceCheckUtils]: 128: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume 8672 == #t~mem79;havoc #t~mem79; {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,111 INFO L290 TraceCheckUtils]: 129: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,111 INFO L290 TraceCheckUtils]: 130: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-14 18:41:50,112 INFO L290 TraceCheckUtils]: 131: Hoare triple {131018#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {131019#(and (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))) (not (= (+ (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 792) ssl3_accept_~s.offset)))} is VALID [2022-04-14 18:41:50,113 INFO L290 TraceCheckUtils]: 132: Hoare triple {131019#(and (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))) (not (= (+ (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 792) ssl3_accept_~s.offset)))} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,113 INFO L290 TraceCheckUtils]: 133: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,114 INFO L290 TraceCheckUtils]: 134: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,114 INFO L290 TraceCheckUtils]: 135: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,114 INFO L290 TraceCheckUtils]: 136: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,115 INFO L290 TraceCheckUtils]: 137: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,115 INFO L290 TraceCheckUtils]: 138: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,115 INFO L290 TraceCheckUtils]: 139: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,116 INFO L290 TraceCheckUtils]: 140: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,116 INFO L290 TraceCheckUtils]: 141: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,116 INFO L290 TraceCheckUtils]: 142: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,117 INFO L290 TraceCheckUtils]: 143: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,117 INFO L290 TraceCheckUtils]: 144: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,117 INFO L290 TraceCheckUtils]: 145: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,118 INFO L290 TraceCheckUtils]: 146: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,118 INFO L290 TraceCheckUtils]: 147: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,118 INFO L290 TraceCheckUtils]: 148: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,119 INFO L290 TraceCheckUtils]: 149: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,119 INFO L290 TraceCheckUtils]: 150: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,119 INFO L290 TraceCheckUtils]: 151: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,120 INFO L290 TraceCheckUtils]: 152: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,120 INFO L290 TraceCheckUtils]: 153: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,120 INFO L290 TraceCheckUtils]: 154: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,121 INFO L290 TraceCheckUtils]: 155: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,121 INFO L290 TraceCheckUtils]: 156: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,121 INFO L290 TraceCheckUtils]: 157: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,122 INFO L290 TraceCheckUtils]: 158: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:41:50,122 INFO L290 TraceCheckUtils]: 159: Hoare triple {131020#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {131021#(= 8448 |ssl3_accept_#t~mem68|)} is VALID [2022-04-14 18:41:50,122 INFO L290 TraceCheckUtils]: 160: Hoare triple {131021#(= 8448 |ssl3_accept_#t~mem68|)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {131008#false} is VALID [2022-04-14 18:41:50,122 INFO L290 TraceCheckUtils]: 161: Hoare triple {131008#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {131008#false} is VALID [2022-04-14 18:41:50,122 INFO L290 TraceCheckUtils]: 162: Hoare triple {131008#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {131008#false} is VALID [2022-04-14 18:41:50,122 INFO L290 TraceCheckUtils]: 163: Hoare triple {131008#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {131008#false} is VALID [2022-04-14 18:41:50,122 INFO L290 TraceCheckUtils]: 164: Hoare triple {131008#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {131008#false} is VALID [2022-04-14 18:41:50,123 INFO L290 TraceCheckUtils]: 165: Hoare triple {131008#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {131008#false} is VALID [2022-04-14 18:41:50,123 INFO L290 TraceCheckUtils]: 166: Hoare triple {131008#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {131008#false} is VALID [2022-04-14 18:41:50,123 INFO L290 TraceCheckUtils]: 167: Hoare triple {131008#false} assume 8640 == #t~mem75;havoc #t~mem75; {131008#false} is VALID [2022-04-14 18:41:50,123 INFO L290 TraceCheckUtils]: 168: Hoare triple {131008#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {131008#false} is VALID [2022-04-14 18:41:50,123 INFO L290 TraceCheckUtils]: 169: Hoare triple {131008#false} assume 4 == ~blastFlag~0; {131008#false} is VALID [2022-04-14 18:41:50,123 INFO L290 TraceCheckUtils]: 170: Hoare triple {131008#false} assume !false; {131008#false} is VALID [2022-04-14 18:41:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:41:50,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:41:50,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713197325] [2022-04-14 18:41:50,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713197325] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 18:41:50,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709148640] [2022-04-14 18:41:50,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:41:50,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:41:50,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:41:50,125 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 18:41:50,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 18:41:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:51,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 221 conjunts are in the unsatisfiable core [2022-04-14 18:41:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:41:51,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 18:41:52,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-14 18:41:57,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-14 18:41:57,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-14 18:41:57,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-14 18:41:57,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-14 18:41:57,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-14 18:41:57,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-14 18:41:57,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-14 18:41:57,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-14 18:41:57,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-14 18:41:57,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-14 18:41:57,616 INFO L244 Elim1Store]: Index analysis took 182 ms